perplexus.info :: Numbers : Quite a triplet

Home > Numbers

Quite a triplet (Posted on 2015-07-02)

Let (n,n+1,n+2) represent a triplet of consecutive numbers, each having 5 distinct prime factors.

Find tne value of the lowest n.

No Solution Yet Submitted by Ady TZIDON

No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)

more info

| Comment 4 of 10 |

Hi, broll and Ch,.... .& others

I refer you to

which "triggered" my puzzle.

Posted by Ady TZIDON on 2015-07-03 03:35:18

Please log in:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (0)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info