Bound · version 2

Gaps at most 240, infinitely often

Statement

For every real X, there are consecutive primes p < q with p ≥ X and q − p ≤ 240; in other words H1≤240H_1\le240.

Assumptions

  • Consecutive positive primes.
  • No additional conjectural hypothesis in the cited mathematical result.

Scope

An unconditional upper bound on the recurring gap, attributed to Stadlmann; it does not imply every gap is this small.

Explanation

Bounds & computations · 1

Compare the quantity and hypotheses within each group. A finite check, conditional theorem and proposed improvement cover different scopes.

H₁
ResultValueConditions
Gaps at most 240, infinitely often →

Proved

Selected source date:

≤ 240Unconditional bound for gaps between consecutive primes occurring infinitely often.

Evidence

Connections

In this problem · publication v7

How small can prime gaps be? →

Bound · Proved

Scope: Julia Stadlmann’s 2026 work improved the distribution estimates used by the sieve.

Limit: The target H₁ = 2 is not established.

Nested results concern the same prime-gap limit; they are not separate portions of a solved problem.

Related results · 3

Relationship not independently reviewed. This concerns its use in this problem.

Sources

A new bound for small gaps between primes →

François Charton · Letong Hong · Kenny Lau · Ken Ono · Guillaume Remy · Ho Chung Siu · Ashvin A. Swaminathan · Jesse Thorner · Yunzhou Xie · Preprint · Publication date Sep 3, 2026

Public manuscript or exposition; publication does not imply independent OpenMath review.

Revision & attribution

Source revision: 2026-09-03. Observed Oct 13, 2026.

The nine authors supply the mathematics, building on Julia Stadlmann and earlier sieve work. AxiomProver is credited with generating a formal deduction; this is not a claim that the model independently discovered the mathematical bound.

Source updated Sep 3, 2026.

Variants of the Selberg sieve, and bounded intervals containing many primes →

D. H. J. Polymath · Published · Publication date 2014

Peer-reviewed historical result.

Revision & attribution

Source revision: 2014. Observed Oct 13, 2026.

No AI contribution is asserted by this source record.

Bounded gaps between primes →

  • Abstract → · Original passage ↗
    Recorded wording

    Zhang proves that lim inf (pₙ₊₁ − pₙ) < 7 × 10⁷, refining Goldston–Pintz–Yıldırım with a stronger Bombieri–Vinogradov estimate for moduli without large prime factors.

    paraphrase · OpenMath supplies original paraphrases and links; no proof text is republished.

Yitang Zhang · Published · Publication date May 1, 2014

Annals of Mathematics 179(3), 1121–1174 (2014); DOI checked against Crossref.

Revision & attribution

Source revision: 2014-05-01. Observed Oct 21, 2026.

No AI contribution is asserted by this source record.

Small gaps between primes →

  • Abstract → · Original passage ↗
    Recorded wording

    Maynard shows that lim inf (pₙ₊₁ − pₙ) ≤ 600, and ≤ 12 assuming the Elliott–Halberstam conjecture.

    paraphrase · OpenMath supplies original paraphrases and links; no proof text is republished.

James Maynard · Published · Publication date 2015

Annals of Mathematics 181, 383–413 (2015), DOI 10.4007/annals.2015.181.1.7 checked against Crossref; arXiv v3 pinned by content hash.

Revision & attribution

Source revision: 2015. Observed Oct 21, 2026.

No AI contribution is asserted by this source record.

History

Statement versions

Statement versions and problem publication versions are separate. A new publication can update context or sources while retaining the same statement.

Assessment history · 1

Assessments retained in these publication records. Earlier statement versions retain their own source histories.

Record details
Claim ID
claim-prime-gaps-bound-240
Statement version
2
SHA-256
ead2118e20654c395c91f539a2115d9defeea195bd727a8fd1d88c2d04e3888f

Publication records