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

Home > Numbers
A Divisor Diversion (Posted on 2019-03-27) Difficulty: 3 of 5
Find the sum of all positive integers n, each of which has precisely 16 positive divisors and a successor n+1 that has precisely 3 divisors.

No Solution Yet Submitted by Danish Ahmed Khan    
Rating: 5.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
No Subject | Comment 1 of 5
A number can only have 3 factors if it is the square of a prime: n+1=t^2 for prime t.

A number with 16 factors must have the following prime factorizations: p^15, q*p^8, q^3*p^3, r*q*p^4, s*r*q*p

n=t^2-1=(t+1)(t-1) 
After ruling out t=2 we see that n has at least 2^3 and no other prime factor can appear more than once.  

So n is either 2^15 or of the form q*2^8, r*q*2^4, s*r*q*2.
2^15 doesn't work.  I don't have time to check the other cases.



  Posted by Jer on 2019-03-27 14:56:21
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 (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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