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: ( You must be logged in to post comments.)
  Subject Author Date
re(4): computer solution -- prolonged searchCharlie2015-07-04 08:06:14
re(3): computer solution -- prolonged searchbroll2015-07-04 00:06:06
re(2): computer solution -- prolonged searchCharlie2015-07-03 11:36:27
Hints/Tipsre: computer solution new sequebce !!Ady TZIDON2015-07-03 08:51:49
Some Thoughtsre(2): more infoAdy TZIDON2015-07-03 08:21:53
re: more infoCharlie2015-07-03 07:56:45
Hints/Tipsmore infoAdy TZIDON2015-07-03 03:35:18
re: computer solutionbroll2015-07-02 22:23:37
Silly Observation?Kenny M2015-07-02 18:49:15
Solutioncomputer solutionCharlie2015-07-02 15:49: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 (4)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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