Acta Mathematica · 2010 · 53 citations · 23 references
Natural SciencesMathematicsCombinatoricsNumber TheoryProbability TheoryLimit TheoremsNumber-theoretic AlgorithmsPrime Gaps
We prove that $ \mathop{ \lim \inf}\limits_{n \rightarrow \infty} \frac{p_{n+1}-p_{n}}{\sqrt{\log p_{n}} \left(\log \log p_{n}\right)^{2}}< \infty, $where pn denotes the nth prime. Since on average pn+1−pn is asymptotically log n, this shows that we can always find pairs of primes much closer together than the average. We actually prove a more general result concerning the set of values taken on by the differences p−p′ between primes which includes the small gap result above.
23
Primes in arithmetic progressions to large moduli
Enrico Bombieri, John Friedlander, Henryk Iwaniec · Acta Mathematica · 1986 · 274 citations · Full text
On the distribution of primes in short intervals
P. X. Gallagher · Mathematika · 1976 · 173 citations
D. A. Goldston, J. Pintz, C. Y. Yıldırım · Annals of Mathematics · 2009 · 168 citations · Full text