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: computer solution | Comment 3 of 10 |
(In reply to computer solution by Charlie)

Interesting. I had a look at this before deciding it was too difficult.

I had read '5 distinct prime factors' as being non-powered factors, since a factor that repeats is not distinct. This would imply divisibility of the central number of the triplet by exactly 2.

However, none of the triplets given has that form.

Is this a feature of such triplets, or is it just that the search needs to be prolonged?

  Posted by broll on 2015-07-02 22:23:37
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 (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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