All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
Quite a triplet (Posted on 2015-07-02) Difficulty: 3 of 5
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.)
Some Thoughts re(2): more info | Comment 6 of 10 |
(In reply to re: more info by Charlie)

The question then is, Can such a series of 3 ..........etc - you have pinpointed the essential question,  which might be resolved (or not) by your  program   if you extend  its  range.

I f you find an example of an odd n, please let us know.

  Posted by Ady TZIDON on 2015-07-03 08:21:53
Please log in:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information