Encyclosphere.org ENCYCLOREADER
  supported by EncyclosphereKSF

Dirichlet formula

From Encyclopediaofmath - Reading time: 1 min

2020 Mathematics Subject Classification: Primary: 11N37 [MSN][ZBL]

for the number of divisors

The asymptotic formula

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

where $\tau(n)$ is the number of divisors of $n$ and $\gamma$ is the Euler constant, $\gamma \approx 0.577$. 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[edit]

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


Comments[edit]

The formula implies that the average order of $\tau(n)$ is $\log n$.

See also Divisor problems.

This article is licensed under CC BY-SA 3.0.
Original source: https://encyclopediaofmath.org/wiki/Dirichlet formula
Status: article is cached
Encyclosphere.org EncycloReader is supported by the EncyclosphereKSF