Abstract
Maynard shows that lim inf (pₙ₊₁ − pₙ) ≤ 600, and ≤ 12 assuming the Elliott–Halberstam conjecture.
Passage details
Passage ID: prime-gaps:entry:maynard:v1
Source item: Abstract
Source record: prime-gaps:source:maynard:v1
Reading source record 2015. View default cited record →
Maynard’s multidimensional sieve gives recurring prime gaps of at most 600.
Annals of Mathematics 181, 383–413 (2015), DOI 10.4007/annals.2015.181.1.7 checked against Crossref; arXiv v3 pinned by content hash.
The exact passages cited in OpenMath. Each passage identifies how its wording was recorded.
Maynard shows that lim inf (pₙ₊₁ − pₙ) ≤ 600, and ≤ 12 assuming the Elliott–Halberstam conjecture.
Passage ID: prime-gaps:entry:maynard:v1
Source item: Abstract
Source record: prime-gaps:source:maynard:v1
Explicit citations in versioned problem publications. A citation records a use; it does not confer proof or independent verification.
Problem publication v7
Source assessment
Proved
Maynard: H₁ ≤ 600
Only the exact statement and passage cited here; not an independent OpenMath assessment.
Observed Oct 21, 2026
Recorded authorship
James Maynard
No AI contribution is asserted by this source record.
OpenMath source records preserve exact citations. Observation dates order these records; they do not establish the latest upstream paper or proof.
Small gaps between primes
OpenMath supplies original paraphrases and links; no proof text is republished.
Source terms ↗