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.)
Hints/Tips re: computer solution new sequebce !! | Comment 7 of 10 |
(In reply to computer solution by Charlie)

IMHO, you have created a sequence of numbers  representing the 1st in a a triplet of consecutive numbers, each having AT LEAST 5 distinct prime factors.

While similar lists  e.g.  A117969 EXIST, this one is absent.

IMHO , it qualifies- please consider to submit it.

  Posted by Ady TZIDON on 2015-07-03 08:51:49
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 (5)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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