# Divisor function

In mathematics, and specifically in number theory, a divisor function is an arithmetical function related to the divisors of an integer. When referred as the divisor function, it counts the number of divisors of an integer. It appears in a number of remarkable identities, including relationships on the Riemann zeta function and the Eisenstein series of modular forms. Divisor functions were studied by Ramanujan, who gave a number of important congruences and identities.

Prerequisites
Mathematical symbols ${\displaystyle \sum \prod \infty }$
Exponentiation ${\displaystyle x^{y}}$
Logarithm ${\displaystyle \ln \ \log }$
Limit superior ${\displaystyle \limsup _{n\rightarrow \infty }}$

## Definition

The divisor function σx(n) is defined as the sum of the xth powers of the positive divisors of n, or

${\displaystyle \sigma _{x}(n)=\sum _{d|n}d^{x}\,\!.}$

The notations d(n) and ${\displaystyle \tau (n)}$ (the tau function) are also used to denote σ0(n), or the number of divisors of n. When x is 1, the function is called the sigma function or sum-of-divisors function, and the subscript is often omitted.

${\displaystyle \sigma _{0}(n)\equiv \tau (n)\equiv d(n)}$
${\displaystyle \sigma _{1}(n)\equiv \sigma (n)}$

For example, σ0(12) may be considered as the sum of the zeroth powers of the divisors of 12:

 ${\displaystyle \sigma _{0}(12)}$ ${\displaystyle =1^{0}+2^{0}+3^{0}+4^{0}+6^{0}+12^{0}}$ ${\displaystyle =1+1+1+1+1+1=6.}$

while σ1(12) is equal to the sum of the divisors' first powers:

 ${\displaystyle \sigma _{1}(12)}$ ${\displaystyle =1^{1}+2^{1}+3^{1}+4^{1}+6^{1}+12^{1}}$ ${\displaystyle =1+2+3+4+6+12=28.}$

For a prime number p,

${\displaystyle \sigma _{0}(p)=2}$
${\displaystyle \sigma _{1}(p)=p+1}$

because by definition, the factors of a prime number are 1 and itself. Clearly, 1 < d(n) < n and σ(n) > n for all n > 1.

The divisor function is multiplicative, but not completely multiplicative. The consequence of this is that, if we write

${\displaystyle n=\prod _{i=1}^{r}p_{i}^{a_{i}}}$

where r is the number of distinct prime factors of n, pi is the ith prime factor, and ai is the maximum power of pi by which n is divisible, then we have

${\displaystyle \sigma (n)=\prod _{i=1}^{r}{\frac {p_{i}^{a_{i}+1}-1}{p_{i}-1}}}$

which is equivalent to the useful formula:

${\displaystyle \sigma (n)=\prod _{i=1}^{r}\sum _{j=0}^{a_{i}}p_{i}^{j}=\prod _{i=1}^{r}(1+p_{i}+p_{i}^{2}+...+p_{i}^{a_{i}})}$

An equation for calculating ${\displaystyle \tau (n)}$ is

${\displaystyle \tau (n)=\prod _{i=1}^{r}(a_{i}+1)}$

For example, if n is 24, there are two prime factors (p1 is 2; p2 is 3); noting that 24 is the product of 23×31, a1 is 3 and a2 is 1. Thus we can calculate ${\displaystyle \tau (24)}$ as so:

 ${\displaystyle \tau (24)}$ ${\displaystyle =\prod _{i=1}^{2}(a_{i}+1)}$ ${\displaystyle =(3+1)(1+1)=4\times 2=8.}$

The eight divisors counted by this formula are 1, 2, 4, 8, 3, 6, 12, and 24.

We also note ${\displaystyle s(n)=\sigma (n)-n}$. This function is the one used to recognize perfect numbers which are the n for which ${\displaystyle s(n)=n}$. If s(n) > n then n is an abundant number and if s(n) < n then n is a deficient number.

As an example, for two distinct primes p and q, let

${\displaystyle n=pq.}$

Then

${\displaystyle \phi (n)=(p-1)(q-1)=n+1-(p+q),}$
${\displaystyle \sigma (n)=(p+1)(q+1)=n+1+(p+q).}$

## Properties

In 1984, Roger Heath-Brown proved that

d(n) = d(n + 1)

will occur infinitely often.

## Series relations

Two Dirichlet series involving the divisor function are:

${\displaystyle \sum _{n=1}^{\infty }{\frac {\sigma _{a}(n)}{n^{s}}}=\zeta (s)\zeta (s-a)}$

and

${\displaystyle \sum _{n=1}^{\infty }{\frac {\sigma _{a}(n)\sigma _{b}(n)}{n^{s}}}={\frac {\zeta (s)\zeta (s-a)\zeta (s-b)\zeta (s-a-b)}{\zeta (2s-a-b)}}}$

A Lambert series involving the divisor function is:

${\displaystyle \sum _{n=1}^{\infty }q^{n}\sigma _{a}(n)=\sum _{n=1}^{\infty }{\frac {n^{a}q^{n}}{1-q^{n}}}}$

for arbitrary complex |q| ≤ 1 and a. This summation also appears as the Fourier series of the Eisenstein series and the invariants of the Weierstrass elliptic functions.

## Inequalities

For the number of divisors function,

${\displaystyle d(n), for n > 12.

Another bound on the number of divisors is

${\displaystyle \log d(n)<1.066{\frac {\log n}{\log \log n}}}$, for n ≥ 3.

For the sum of divisors function,

${\displaystyle \sigma (n)<{\frac {6n^{\frac {3}{2}}}{\pi ^{2}}}}$, for n > 12.

A pair of inequalities combining the divisor function and the φ function are:

${\displaystyle {\frac {6n^{2}}{\pi ^{2}}}<\varphi (n)\sigma (n), for n > 1.

## Approximate growth rate

The behaviour of the sigma function is irregular. The growth rate of the sigma function can be expressed by:

${\displaystyle \limsup _{n\rightarrow \infty }{\frac {\sigma (n)}{n\ \log \log n}}=e^{\gamma }.}$

where ${\displaystyle \gamma }$ is Euler's constant. This result is Gronwall's Theorem, published in 1913.

Interestingly, in 1984 Guy Robin proved that

${\displaystyle \sigma (n) for n > 5,040

is true if and only if the Riemann hypothesis is true. The largest known value that violates the inequality is n=5,040. If the Riemann hypothesis is true, there are no others. If the hypothesis is false then there are an infinite number of values of n that violate the inequality.

A related bound was given by Jeffrey Lagarias in 2002, who proved that the Riemann hypothesis is equivalent to the statement that

${\displaystyle \sigma (n)\leq H_{n}+\ln(H_{n})e^{H_{n}}}$

for every natural number n, where ${\displaystyle H_{n}}$ is the nth harmonic number.