Number theory Analytic number theory Theorem
Bounded gaps between primes
Builds on Prime numberLimit inferiorSelberg sieveBombieri–Vinogradov theorem
Statement
Let denote the -th prime number. There is a constant such that for infinitely many . Equivalently, where is the limit inferior.
Remarks
Yitang Zhang proved the statement in 2013 with . James Maynard, and independently Terence Tao, gave a simpler proof with , and the Polymath project lowered the bound to . Maynard's method also shows that for every , . The proof builds on the method of Goldston, Pintz and Yıldırım: a Selberg sieve with multidimensional weights detects a tuple that contains at least two primes. The input on primes in arithmetic progressions is the Bombieri–Vinogradov theorem in Maynard's version and a strengthening of it for smooth moduli in Zhang's version. The twin prime conjecture is the claim that works; it remains open.
Going deeper
For a student
The statement is the first unconditional step towards the twin prime conjecture. Goldston, Pintz and Yıldırım had shown that bounded gaps would follow from a level of distribution of the primes greater than , which is beyond the Bombieri–Vinogradov theorem. Zhang proved such a level for a restricted class of moduli; Maynard changed the sieve weights so that the level is already enough. Under the Elliott–Halberstam conjecture and its generalisations, the method gives smaller values of , down to .
Reading path
To understand this page from the ground up, read these 22 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Algebraic number field concept
- Big O notation concept
- Chebyshev functions concept
- Dedekind zeta function concept
- Dirichlet L-function concept
- Dirichlet character concept
- Divisibility definition
- Euler's totient function concept
- Large sieve concept
- Limit inferior concept
- Prime number concept
- Selberg sieve concept
- Siegel zero concept
- Zero of a holomorphic function concept
- von Mangoldt function concept
- Prime number definition
- Generalized Riemann hypothesis conjecture
- Prime-counting function definition
- Prime number theorem statement
- Siegel–Walfisz theorem statement
- Bombieri–Vinogradov theorem statement
- Bounded gaps between primes statement
Further reading
About this page
| Tag | XMXFDWYYMD |
|---|---|
| URI | m2://XMXFDWYYMD |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 11N05, 11N36 |
| Status | This copy of the site has no build data. Run m2 status XMXFDWYYMD. |
| About | Prime number, Twin prime conjecture |
| Uses | Prime number, Limit inferior, Selberg sieve, Bombieri–Vinogradov theorem |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.