Define to be the number of positive divisors of for a positive integer For example,
If then find the sum of all the possible values of
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
First, the inequality d ( n ) ≤ 2 n implies that d ( n ) n ≥ 2 n , so n ≤ 4 0 3 6 2 . (For a proof of the inequality, see my solution to Divisor Problem (2), or just think about pairing off divisors which multiply to n . )
Now n = 2 0 1 8 d ( n ) , so the prime 1 0 0 9 must divide n . If 1 0 0 9 2 ∣ n , then 1 0 0 9 ∣ d ( n ) , which implies that n has a prime divisor with exponent at least 1 0 0 8 . This would make n far bigger than 4 0 3 6 2 , so the conclusion is that n = 1 0 0 9 a where a is coprime to 1 0 0 9 . This implies 2 0 1 8 = d ( n ) n = d ( 1 0 0 9 a ) 1 0 0 9 a = 2 1 0 0 9 d ( a ) a , so d ( a ) a = 4 .
By the inequality from the beginning, we need only search for such a up to a = 8 2 , and a quick search finds that there is exactly one solution, a = 3 6 . Hence there is only one value of n , n = 1 0 0 9 ⋅ 3 6 = 3 6 3 2 4 .