Divisor Sum of Square-Free Integer/Proof 1

Theorem

Let $n$ be an integer such that $n \ge 2$.

Let $n$ be square-free.

Let the prime decomposition of $n$ be:

$\ds n = \prod_{1 \mathop \le i \mathop \le r} p_i = p_1 p_2 \cdots p_r$

Let $\map {\sigma_1} n$ be the divisor sum of $n$.

That is, let $\map {\sigma_1} n$ be the sum of all positive divisors of $n$.

Then:

$\ds \map {\sigma_1} n = \prod_{1 \mathop \le i \mathop \le r} p_i + 1$

Proof

We have that the Divisor Sum Function is Multiplicative.

From the definition of prime number, each of the prime factors of $n$ is coprime to all other divisors of $n$.

From Divisor Sum of Prime Number, we have:

$\map {\sigma_1} {p_i} = p_i + 1$

Hence the result.

$\blacksquare$

Examples

$\sigma_1$ of $66$

$\map {\sigma_1} {66} = 144$

$\sigma_1$ of $70$

$\map {\sigma_1} {70} = 144$

$\sigma_1$ of $110$

$\map {\sigma_1} {110} = 216$

$\sigma_1$ of $170$

$\map {\sigma_1} {170} = 324$