Divisor count 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 count function of $n$, denoted $d(n)$ $\sigma _{0}(n)$, or $\tau (n)$, is defined as the number of positive divisors of $n$. In other words:

$\sigma _{0}(n)=\sum _{d|n}1$.

Formula in terms of prime factorization

Suppose we have:

$n=p_{1}^{k_{1}}p_{2}^{k_{2}}\dots p_{r}^{k_{r}}$.

Then:

$\sigma _{0}(n)=\prod _{i=1}^{r}(k_{i}+1)$.

Behavior

Lower bound

The divisor count function of $n$ takes its lowest value (other than $1$) at primes.

$\sigma _{0}(p)=2\ \forall \ p$.

In particular:

$\lim \inf _{n\to \infty }\sigma _{0}(n)=2$.

Upper bound

Fill this in later

Relation with other arithmetic functions

Family of divisor power sum functions

For any real number (typically, integer) $k$, the divisor power sum function $\sigma _{k}$ is the sum of $k^{th}$ powers of all the positive divisors of $k$. The divisor count function is the special case $k=0$. The case $k=1$ is the divisor sum function, often just denoted $\sigma$, while the case $k=2$ is the divisor square sum function.

Relations expressed in terms of Dirichlet products

• $\sigma _{0}=U*U$: The divisor count function can be expressed as the Dirichlet product of the all ones function with itself.
• $\sigma _{0}*\mu =U$: This is obtained simply by applying the Mobius inversion formula to the previous statement. In other words, the Dirichlet product of the divisor count function and the Mobius function is the all ones function.
• $\sigma _{0}*\varphi =\sigma$: The Dirichlet product of the divisor count function and the Euler phi-function is the divisor sum function.