Given that 1 4 0 0 = 2 3 × 5 2 × 7 , find the sum of its positive divisors.
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.
And could someone post a link to a good proof of this, thanks.
Log in to reply
If the prime factorization of N = p 1 q 1 p 2 q 2 p 3 q 3 … p n q n where p i are distinct promes, and the q i are positive integers.
The the sum of all the divisors of n is
r 1 , r 2 , … , r n = 0 ∑ q 1 , q 2 , … , q n [ p 1 r 1 p 2 r 2 p 3 r 3 … p n r n ]
Which equals to
( p 1 0 + p 1 1 + … + p 1 q 1 ) ( p 2 0 + p 2 1 + … + p 2 q 2 ) … ( p n 0 + p n 1 + … + p n q n )
(Sum of geometric progression)
( p 1 − 1 p 1 q 1 + 1 − 1 ) ( p 2 − 1 p 2 q 2 + 1 − 1 ) … ( p n − 1 p n q n + 1 − 1 )
Log in to reply
And negative dividers?
Log in to reply
@Daniel Ferreira – If we want to consider the negative divisors too then the sum of all divisors will be 0.
Suppose we start with powers of 7 namely 7 0 , 7 1 yielding divisors 1 and 7 whose sum is 8
Now we consider their combination with powers of 5 which are (1, 5, 25) Fetching us two groups of divisors (1, 5, 25) and (7, 35, 175)
This will give an overall sum of all divisors that contain only powers of 7 and 5 as (1 + 7) (1 + 5 + 25)
Finally we throw in the powers of 2 giving the overall sum of divisors as ( 1 + 7 ) ( 1 + 5 + 2 5 ) ( 1 + 2 + 4 + 8 ) = ( 8 ) ( 3 1 ) ( 1 5 ) = 3 7 2 0
but i still can't understand how does it work
The problem can be solved in the following way:
p − 1 p a + 1 − 1 X q − 1 q b + 1 − 1 X r − 1 r c + 1 − 1
where, p,q and r are the first, second and third prime divisor, and a, b and c are the powers of p,q and r respectively.
Thus,
S n = 2 − 1 2 3 + 1 − 1 X 5 − 1 5 2 + 1 − 1 X 7 − 1 7 1 + 1 − 1
S n = 1 2 4 − 1 X 4 5 3 − 1 X 6 7 2 − 1
S n = 1 1 5 X 4 1 2 4 X 6 4 8
S n = 15 X 31 X 8
S n = 3 7 2 0
Simple enough just Put the value in theorem and ans is ready
Problem Loading...
Note Loading...
Set Loading...
To find the sum of divisors, you take the product of each prime factor with its power+1 then divide it by each divisor-1.
In this case, it is
2 3 , 5 2 , 7
( 2 − 1 ) ( 5 − 1 ) ( 7 − 1 ) ( 2 4 − 1 ) ( 5 3 − 1 ) ( 7 2 − 1 )
2 4 8 9 2 8 0
3 7 2 0