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.)
Some Thoughts start | Comment 2 of 14 |

To have exactly 144 distinct positive divisors, the number must factor into the squares of each of two different prime numbers, and the first power of each of four other prime numbers. That way each of the 144 factors can be formed by multiplying 0, 1 or 2 occurrences of each of the squared primes, and 0 or 1 each of the first-power primes.

With 2^2 * 3^2 * 5 * 7 * 11 * 13, there can't be a divisor of 8, though all other divisors from 1 through 15 work, so some other set of primes needs to be considered (unless there's a sequence of 10 that's higher up using this set).


  Posted by Charlie on 2006-02-20 10:32:24
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 (2)
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