The sum of all the divisors of , a positive integer, are summed, the result is
Find the sum of the smallest 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.
The numbers are powers of 3 .
P R O O F : −
Let N = a p × b q × c r × d s
Then sum of divisors are ( a − 1 ) × ( b − 1 ) × ( c − 1 ) × ( d − 1 ) ( a p + 1 − 1 ) × ( b q + 1 − 1 ) × ( c r + 1 − 1 ) × ( d s + 1 − 1 ) .
So now let N be x = 3 n , then the sum of divisors = 3 − 1 3 n + 1 − 1 .
Replacing x = 3 n ,
The sum of divisors = 2 3 x − 1 .