Divisor sum function

This article defines an arithmetic function or number-theoretic function: a function from the natural numbers to a ring (usually, the ring of integers, rational numbers, real numbers, or complex numbers).
View a complete list of arithmetic functions

Definition

Let $n$ be a natural number. The divisor sum function of $n$, denoted $\sigma (n)$, is defined in the following equivalent ways:

1. $\sigma$ is the Dirichlet product of the identity function $E$ on the natural numbers and the all-one function $U$: the function sending every natural number to $1$.
2. We have $\sigma (n)={\sum }_{d|n}d$.

Formula in terms of prime factorization

Suppose we have:

$n=p_1^{k_1}{p}_2^{k_2}\dots p_r^{k_r}$,

where the $p_i$ are distinct prime divisors of $n$. Then:

$\sigma (n)=\prod _{i=1}^r(\frac{p_i^{k_i+1}-1}{p_i-1})$.

Equivalently, the ratio is given by:

$\frac{\sigma (n)}{n}=\prod _{i=1}^r(\frac{1-(1/p_i^{k_i+1})}{1-1/p_i})$.

Behavior

Lower bound

For any $n>1$, $\sigma (n)\ge n+1$. Equality is achieved if and only if $n$ is prime. Further, $\sigma (n)$ is the lowest, in relative terms, for primes. In particular, excluding the case $n=1$, the fraction $\sigma (n)/n$ achieves a strict minimum-so-far at every prime, and nowhere else.

Thus, we have:

$\underset{n\to \mathrm{\infty }}{lim}\sigma (n)\to \mathrm{\infty }$,

and:

$lim{inf}_{n\to \mathrm{\infty }}\frac{\sigma (n)}{n}=1$,

Upper bound

Gronwall's theorem asserts that:

$lim{sup}_{n\to \mathrm{\infty }}\frac{\sigma (n)}{n\log \log n}=e^{\gamma }$

where all the logarithms are natural logarithms and $\gamma$ is the Euler-Mascheroni constant.

A closely related result is Robin's theorem, which states that the Riemann hypothesis is equivalent to the statement that for $n\ge 5041$, the ratio is always strictly less than $e^{\gamma }$.

Summatory function

Fill this in later

Relation with other arithmetic functions

Relations expressed in terms of Dirichlet products

• $\sigma =E*U$: $\sigma$ is the Dirichlet product of the identity function and the all ones function.
• $\sigma *\mu =E$: The Dirichlet product of $\sigma$ and the Mobius function is the identity function. Note that this is the [[Mobius inversion formula applied to the previous statement; equivalently, it is obtained by multiplying both sides of the previous equation by $\mu$.
• $\sigma *\varphi =E*E$: The Dirichlet product of $\sigma$ and the Euler phi-function equals the Dirichlet product of the identity function with itself, which in turn is the (pointwise) product of the identity function and the divisor count function.

Relation with properties of numbers

• Perfect number: A natural number $n$ such that $\sigma (n)=2n$.
• Abundant number: A natural number $n$ such that $\sigma (n)>2n$.
• Deficient number: A natural number $n$ such that $\sigma (n)<2n$.
• Superabundant number: A natural number $n$ that is a strict maximum-so-far for $\sigma (n)/n$.

Properties

$\sigma$ is a multiplicative function but not a completely multiplicative function.