OpenFrontiers
← Back to the index
OP-12078OpenNumber theory

Dirichlet divisor problem exponent (C63C_{63})

Dirichlet divisor problem exponent: determine C63C_{63} or improve its bounds; the repository records 14\frac{1}{4} (lower) and 131416\frac{131}{416} (upper).

Editorial MSC2020 classification. Original article codes and source evidence are recorded in the literature directory.

Licensed source statementAs of Repository table at commit 2c1968c (2026-09-26); open while the recorded lower and upper bounds differSource & evidence ↓

Problem statement

Let d(n)d(n) be the divisor function. The Dirichlet divisor problem concerns the error term

Δ(x) := ∑n≤xd(n) − x(log⁡x+2γ−1),\Delta(x)\ :=\ \sum_{n\le x} d(n)\ -\ x(\log x + 2\gamma -1),

where γ\gamma is Euler's constant. [Tsa2010-def-Delta]

Define the divisor-problem exponent

α := inf⁡{a≥0: Δ(x)=O(xa+ε) for all ε>0}.\alpha\ :=\ \inf\Bigl\{a\ge 0:\ \Delta(x)=O(x^{a+\varepsilon})\ \text{for all }\varepsilon>0\Bigr\}.

[Tsa2010-def-alpha]

We define

C63 := α,C_{63}\ :=\ \alpha,

the Dirichlet divisor problem exponent.

It is conjectured that α=1/4\alpha=1/4. [Tsa2010-conj-1-4] The best known upper bound is due to Huxley,

α ≤ 131416.\alpha\ \le\ \frac{131}{416}.

[Tsa2010-ub-131-416]

Hardy's omega result implies that Δ(x)=Ω(x1/4)\Delta(x)=\Omega(x^{1/4}) (up to logarithmic factors), hence α≥1/4\alpha\ge 1/4. [Tsa2010-omega-1-4]

The best established range currently is

14 ≤ C63 ≤ 131416.\frac14\ \le\ C_{63}\ \le\ \frac{131}{416}.

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Background

References (from the repository page)

  • [Hux2003] Huxley, M. N. Exponential sums and lattice points III. Proceedings of the London Mathematical Society (3) 87 (2003), no. 3, 591-609. DOI: https://doi.org/10.1112/S0024611503014485. Google Scholar

  • [Tsa2010] Tsang, K.-M. Recent progress on the Dirichlet divisor problem and the mean square of the Riemann zeta-function. IMR Preprint Series 2010-10 (2010). PDF: https://hkumath.hku.hk/~imr/IMRPreprintSeries/2010/IMR2010-10.pdf. Google Scholar

  • [Tsa2010-def-Delta] loc: PDF p.1, Introduction quote: "Let Δ(x)=D(x)−xlog⁡x−(2γ−1)x\Delta(x)=D(x)-x\log x-(2\gamma-1)x be the error term in the above asymptotic formula for D(x)D(x)."

  • [Tsa2010-def-alpha] loc: PDF p.1, Introduction quote: "Dirichlet's divisor problem consists of determining the smallest α\alpha for which Δ(x)≪εxα+ε\Delta(x)\ll_{\varepsilon} x^{\alpha+\varepsilon} holds for any ε>0\varepsilon>0."

  • [Tsa2010-conj-1-4] loc: PDF p.1, Introduction quote: "It is widely conjectured that α=1/4\alpha=1/4 is admissible, which is then the best possible."

  • [Tsa2010-ub-131-416] loc: PDF p.1, Introduction quote: "The best estimate to-date is α≤131/416\alpha\le 131/416, due to Huxley."

  • [Tsa2010-omega-1-4] loc: PDF p.6, Section 3 (Omega-results) quote: "Hardy ... showed that Δ(x)=Ω+((xlog⁡x)1/4log⁡2x)\Delta(x)=\Omega^+((x\log x)^{1/4}\log_2 x) and Δ(x)=Ω−(x1/4)\Delta(x)=\Omega^-(x^{1/4})."

Progress & source assessment

Repository table (commit 2c1968c, 26 September 2026): best known lower bound 14\frac{1}{4}; best known upper bound 131416\frac{131}{416}. Values marked with an asterisk have minimal verification.

Known upper bounds

Bound Reference Comments
131/416131/416 [Hux2003] Record exponent (as stated in survey literature). [Tsa2010-ub-131-416]

Known lower bounds

Bound Reference Comments
00 Trivial from the definition C63≥0C_{63}\ge 0.
1/41/4 [Tsa2010] Omega results imply α≥1/4\alpha\ge 1/4. [Tsa2010-omega-1-4]
References
  1. [1]Davis, Damek; Ivanisvili, Paata; Tao, Terence (maintainers). Optimization Constants in Mathematics, github.com/teorth/optimizationproblems (commit 2c1968c, 26 September 2026). — Dirichlet divisor problem exponent ($C_{63}$) linkApache-2.0 (repository license); constant pages reproduced with attribution; repository references retained.

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.