Bounded gaps between primes
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
It is proved thatwhere pn is the n-th prime.Our method is a refinement of the recent work of Goldston, Pintz and Yıldırım on the small gaps between consecutive primes.A major ingredient of the proof is a stronger version of the Bombieri-Vinogradov theorem that is applicable when the moduli are free from large prime divisors only, but it is adequate for our purpose.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Deligne, P. (1974) · Publications Mathématiques de l'IHÉS · doi:10.1007/bf02684373 · Cited by 2,395 · cited 1×
“This result in turn relies on Deligne’s proof of the Riemann Hypothesis for varieties over finite fields (the Weil Conjecture) [4].”
MethodIncomplete Kloosterman Sums and a Divisor Problem
Friedlander, J., & Iwaniec, H. (1985) · Annals of Mathematics · doi:10.2307/1971175 · Cited by 104
Cited by
Maynard, J. (2015) · Annals of Mathematics · doi:10.4007/annals.2015.181.1.7 · Cited by 303
New applications of the polynomial method: The cap set conjecture and beyond
Grochow, J. (2018) · Bulletin of the American Mathematical Society · doi:10.1090/bull/1648 · Cited by 16
“(1′) What is the additive gap pn+1 − pn between successive primes? (2′) What is the relationship between the factorization of n and that of n+ 1? Only in 2013 was it shown that there is a universal constant C such that pn+1 − pn < C for infinitely many n [139]; C was eventually improved to 246 [95, 104], and the Twin…”
BackgroundAI with Authority, from Application to Silicon
Hickey, J. (2026) · arXiv · doi:10.48550/arxiv.2608.21356 · Cited by 1
Metadata
- Authors
- Zhang, Y.
- Venue
- Annals of Mathematics
- Publisher
- Annals of Mathematics
- Published
- 2014-05-01
- Volume
- 179
- Issue
- 3
- Pages
- 1121-1174
- ISSN
- 0003-486X (ISSN-L)
- OpenAlex
- W2150462872
- Cited by
- 451
- References
- 2
- FWCI
- 90.58
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Bounded gaps between primes. https://app.cochat.ai/papers/10.4007/annals.2014.179.3.7
- The paper
- Zhang, Y. (2014). Bounded gaps between primes. Annals of Mathematics. https://doi.org/10.4007/annals.2014.179.3.7
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.