Dirichlet Divisor-Problem Exponent Conjecture
Canonical statement
View source LaTeX
Let \(d(n)=\#\{a\in\mathbb Z_{>0}:a\mid n\}\) and \(\gamma=\lim_{N\to\infty}(\sum_{k=1}^{N}1/k-\log N)\), and put
\[
\Delta(x)=\sum_{n\le x}d(n)-x\log x-(2\gamma-1)x .
\] For every \(\varepsilon>0\),
\[
\Delta(x)=O_\varepsilon(x^{1/4+\varepsilon})
\quad(x\to\infty).
\]Notes
Let count the divisors of and let be the error term in the classical asymptotic for the average of the divisor function, which Dirichlet established in 1849 with by his hyperbola method [Dirichlet1849Divisor]. The divisor-problem exponent conjecture asserts that for every ; this sharp form emerged in the Voronoï era, around 1916, rather than in a single dated source.
Omega results show that is infinitely often of size comparable to , so the conjectured exponent is the natural threshold and cannot be improved. Upper bounds have advanced from the classical Voronoï-era estimates through the exponential-sum results surveyed in Ivić's book [Ivic1985Zeta] to the strongest current exponents of Huxley [Huxley2003Lattice] and of Bourgain and Watt [BourgainWatt2017], the latter exploiting the close analogy with the mean square of the Riemann zeta function and with the circle problem. All proved exponents remain strictly above , so the conjecture stays open; a resolution demands closing that final gap.
References (4)
- [Dirichlet1849Divisor]
Über die Bestimmung der mittleren Werthe in der Zahlentheorie
P. G. L. Dirichlet · 1849 · misc
- [Ivic1985Zeta]
The Riemann Zeta-Function
Aleksandar Ivić · 1985 · misc
- [Huxley2003Lattice]
Exponential sums and lattice points III
Open ↗M. N. Huxley · 2003 · misc
- [BourgainWatt2017]
Mean square of zeta function, circle problem and divisor problem revisited
Open ↗Jean Bourgain and Nigel Watt · 2017 · misc
The boxed statement is the canonical open formulation — not a stronger variant or a related research program. The status reflects the catalog's last review; do your own literature search before investing serious effort.