Dirichlet formula

for the number of divisors

The asymptotic formula

$$\sum_{n\leq N}\tau(n)=N\ln N+(2C-1)N+O(\sqrt N),$$

where $\tau(n)$ is the number of divisors of $n$ and $C$ is the Euler constant. Obtained by P. Dirichlet in 1849; he noted that this sum is equal to the number of points $(x,y)$ with positive integer coordinates in the domain bounded by the hyperbola $y=N/x$ and the coordinate axes, i.e. equal to

$$\left[\sqrt N\right]^2+2\sum_{x\leq\sqrt N}\left[\frac Nx\right]$$

where $[\alpha]$ denotes the integer part of $\alpha$.

References

[1]	E.C. Titchmarsh, "The theory of the Riemann zeta-function" , Clarendon Press (1951)

Comments

See also Divisor problems.