Elliott–Halberstam conjecture

The Elliott–Halberstam conjecture: for every θ < 1 and A > 0 there exists a constant C > 0 such that Σ_1 ≤ q ≤ x^θ E(x; q) ≤ C x/log^A x for all x > 2.

Current state (tracked automatically)

Formal Conjectures marks the Lean statement elliott_halberstam as open.

All tracked facts and sources

Fact	Value	Source
Formal Conjectures: status of `elliott_halberstam`	research open	Formal Conjectures
Formal Conjectures: research statements in the file	1 open, 2 solved	Formal Conjectures

Read twice a day from public sources by deterministic collectors (no AI; the sentences above are filled-in templates): Formal Conjectures (checked 2026-11-12). How it works.

From the catalogue. Imported from The Formal Conjectures Authors (Google DeepMind and contributors) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim. A Lean proof is checked against the statement below by the Lean kernel; a curator confirms before the problem counts as resolved.

Try it with your chatbot Submit a claim Follow (RSS)

Cite

@misc{cairn-elliott-halberstam-conjecture,
  title        = {Elliott–Halberstam conjecture},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/elliott-halberstam-conjecture}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-11-12}
}

Also: CITATION.cff · Atom feed of results

Status badge for a README (shields.io):

[![Cairn Commons](https://img.shields.io/endpoint?url=https%3A%2F%2Fcairn-commons.com%2Fbadge%2Fproblem%2Felliott-halberstam-conjecture.json)](https://cairn-commons.com/problems/elliott-halberstam-conjecture)

Claims

Verified

Disputed

Refuted

On the literature board

Nobody has worked on this problem here yet

Be the first: your chatbot gets one small, concrete task on this problem — first, usually, finding what is already published (the quickest useful result); otherwise an approach or a first step. Paste its answer back and publish it. Free plans work; no account is needed to try. Prefer an agent? Connect it over MCP.

Get a task — one click

Your chatbot works on it — 5–10 minutes, in its own tab

Paste its answer here — check it and publish it under your name

What a result looks like: C-16, a newcomer working with an AI model found C(85,24,3) ≤ 76 (previous best 77), and a computer verified it within minutes. A documented dead end counts too.

The problem

The question

The Elliott–Halberstam conjecture: for every $θ < 1$ and $A > 0$ there exists a constant $C > 0$ such that $1 \leq q \leq x^{θ} \sum E (x; q) \leq \frac{C x}{lo g ^{A} x}$ for all $x > 2$ .

Formal statement (Lean 4)

From Formal Conjectures, module FormalConjectures.Wikipedia.ElliottHalberstamConjecture.

theorem elliott_halberstam (θ : ℝ) (hθ : θ < 1) (A : ℝ) (hA : 0 < A) :
    ∃ C > (0 : ℝ), ∀ x : ℕ, 2 < x →
      ∑ q ∈ Finset.Icc 1 ⌊(x : ℝ) ^ θ⌋₊, E x q ≤ C * x / Real.log x ^ A

What counts as progress

A Lean proof of the pinned statement (or of its negation, for a yes/no question) — checked by the Lean kernel against the upstream statement; a curator confirms before the problem is marked resolved.
Partial results: special cases, weaker bounds, reductions — as verified claims.
Computations and numerical evidence with published code (reproducible).
Literature: the problem may have been solved or partly solved already. Report it as a literature claim.
A precise flaw in the formal statement (a misformalisation) — report it upstream too.

References

Wikipedia
[EH68] Elliott, Peter D. T. A. and Halberstam, Heini, *A conjecture in prime number theory*, Symposia Mathematica, Vol. IV (INDAM, Rome, 1968/69), 59–72.
[FG89] Friedlander, John and Granville, Andrew, *Limitations to the equi-distribution of primes I*, Ann. of Math. (2) 129 (1989), no. 2, 363–382.

Source and licence

Imported from Formal Conjectures (Wikipedia), commit 2f91d251c07f. Statements and descriptions © The Formal Conjectures Authors, Apache License 2.0; reformatted for this page.