If is the number of positive divisors of , find the smallest integer such that there exist different possible integer values of such that and , and give the sum of these different possible values of as your answer.
Inspiration: Immensely Compound Figure
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.
This is not a complete solution.
It was shown in the solutions to Immensely Compound Figure that 7 ! has 6 0 divisors, but there are no smaller positive integers also with 6 0 divisors. A similar method can be used to show that this property is true for 1 ≤ n ≤ 7 .
However, for n = 8 , 8 ! = 2 7 ⋅ 3 2 ⋅ 5 ⋅ 7 and therefore has ( 7 + 1 ) ( 2 + 1 ) ( 1 + 1 ) ( 1 + 1 ) = 9 6 divisors. There are 5 positive integers smaller than 8 ! = 4 0 3 2 0 that also have 9 6 divisors: 3 6 9 6 0 , 2 7 7 2 0 , 3 7 8 0 0 , 3 0 2 4 0 , and 3 2 7 6 0 , and the sum of these numbers is 1 6 5 4 8 0 .