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.)
re(3): computer solution -- prolonged search | Comment 9 of 10 |
(In reply to re(2): computer solution -- prolonged search by Charlie)

Thanks for that Charlie. By checking the first entry, I see the series is listed at A192203 in Sloane.

I had assumed that they must exist, but they aren't very small!

In retrospect I think my decision to give up on this one was probably right!

Edited on July 4, 2015, 6:56 am
  Posted by broll on 2015-07-04 00:06:06

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