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

Home > Numbers
Gross Division (Posted on 2006-02-20) Difficulty: 3 of 5
Find the smallest positive integer n such that n has exactly 144 distinct positive divisors and there are 10 consecutive integers among them (Note: 1 and n are both divisors of n)

See The Solution Submitted by goFish    
Rating: 3.8000 (5 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: improved further | Comment 5 of 14 |
(In reply to Slightly improved by Tristan)

We can do better.

I started with another set of 10 consecutive integers with the idea that the integer 12, with its multiple factors would be useful in reducing the final result:

3,4,5,6,7,8,9,10,11,12

The factors required for these divisors:

23*32*5*7*11
which has 96 divisors

Adding another factor of 5 gives us 144 divisors.

The resulting number is 23*32*52*7*11 = 138,600.

Perhaps a better solution exists, even yet?


  Posted by Mindrod on 2006-02-20 14:24:52
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


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

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information