# Math Help - Divisors

1. ## Divisors

How do I prove

Sum[sigma(d)]^3 = (Sum[sigma(d))^2 for all n>=1?

Where sigma is the number of divisors and the sum is taken over all d|n.

Is this clear? I'd appreaciate it if somebody could put this into LaTex for me.

2. Originally Posted by Cairo
How do I prove

Sum[sigma(d)]^3 = (Sum[sigma(d))^2 for all n>=1?

Where sigma is the number of divisors and the sum is taken over all d|n.

Is this clear? I'd appreaciate it if somebody could put this into LaTex for me.
Is this correct Latex representation?

for all d|n
$\sum \{\sigma (d)\}^3=\{\sum \sigma (d)\}^2$

3. Yes. Except the d|n should be under both sigma signs.

Thanks for this.

4. Originally Posted by Cairo

How do I prove $\sum_{d \mid n}(\sigma(d))^3 = \left(\sum_{d \mid n}\sigma(d) \right)^2$ for all $n \geq 1$?

Is this clear? I'd appreaciate it if somebody could put this into LaTex for me.
well, you should learn how to use latex yourself instead of asking someone else to do it for you! that's also a good way to show your appreciation to those in here who help you.

anyway, we all know that $\sum_{k=1}^m k^3=\frac{m^2(m+1)^2}{4}=\left(\sum_{k=1}^m k \right)^2.$ now let $n=\prod_{j=1}^r p_j^{m_j}$ be the prime factorization of $n.$ then $d \mid n$ if and only if $d=\prod_{j=1}^r p_j^{s_j},$ where $0 \leq s_j \leq m_j$ for all $j.$

it's clear that $\sigma(d)=\prod_{j=1}^r(1+s_j).$ thus: $S=\sum_{d \mid n}(\sigma(d))^3=\sum_{s_1=0}^{m_1} \cdots \sum_{s_r=0}^{m_r} \prod_{j=1}^r (1+s_j)^3=\prod_{j=1}^r \sum_{s_j=0}^{m_j}(1+s_j)^3.$ but, as i mentioned at the beginning: $\sum_{s_j=0}^{m_j}(1+s_j)^3=\left(\sum_{s_j=0}^{m_ j} (1+s_j) \right)^2,$

for all $j.$ therefore: $S=\prod_{j=1}^r \left(\sum_{s_j=0}^{m_j} (1+s_j) \right)^2 =\left(\sum_{s_1=0}^{m_1} \cdots \sum_{s_r=0}^{m_r} \prod_{j=1}^r (1+s_j) \right)^2=\left(\sum_{d \mid n}\sigma(d) \right)^2.$