Sum of divisors function

Revision as of 17:33, 24 June 2006 by Cosinator (talk | contribs) (fixing latex)

If $p_1^{\alpha_1}\cdot\dots\cdot p_n^{\alpha_n}$ is the prime factorization of $\displaystyle{k}$, then the sum of all divisors of $k$ is given by the formula $s=(p_1^0+p_1^1+...+p_1^{\alpha_1})(p_2^0+p_2^1+...+p_2^{\alpha_2})\cdot\dots\cdot (p_n^0+p_n^1+...+p_n^{\alpha_n})$.

In fact, if you use the formula $1+q+q^2+\ldots+q^n = \frac{q^{n+1}-1}{q-1}$, then the above formula is equivalent to

$s = \displaystyle\left(\frac{p_1^{\alpha_1+1}-1}{p_1-1}\right)\left(\frac{p_2^{\alpha_2+1}-1}{p_2-1}\right)\ldots\left(\frac{p_n^{\alpha_n+1}-1}{p_n-1}\right)$

Derivation

If you expand the monomial into a polynomial you see that it comes to be the addition of all possible combinations of the multiplication of the prime factors, and so all the divisors.

Invalid username
Login to AoPS