Denote d 1 , d 2 , d 3 , … , d n as the distinct positive integral divisors of the number 1 0 5 0 0 .
What is the range of the sum: S = k = 1 ∑ n d k 1 ?
Bonus : Find the exact value of S .
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.
That's very tedious and time consuming. Just do this: (1+1/2+1/4+1/8)(1+1/3)(1+1/5+1/25+1/125)(1+1/7). You can Calculate each bracket using GP.
I don't know if I'm correct but I did it by considering the sum of divisors of 1 0 5 0 0 1 - k = 1 ∑ n d k 1 = [ 1 + 2 1 + 2 2 1 ] [ 1 + 3 1 ] [ 1 + 5 1 + 5 2 1 + 5 3 1 ] [ 1 + 7 1 ] = 3 . 3 2 8
Problem Loading...
Note Loading...
Set Loading...
The dumb way to do it: The prime factorization of 10500 is (2^2)(3)(5^3)(7). (The number of positive integral divisors of 10500 is the product of one more than each exponent in the prime factorization: (3)(2)(4)(2)=48). Made a list of all the possible factors of 10500 that are significant in size (i.e. not 1/10500) (combinations from the PF), took the reciprocal of each one, and added. :)