Abstract
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.
Funding Statement
The first author was supported in part by an NSF Grant, the second author by OTKA grants No. K 67676, T 43623, T 49693 and the Balaton program, the third author by TÜBITAK.
Citation
Daniel A. Goldston. János Pintz. Cem Yalçin Yıldırım. "Primes in tuples II." Acta Math. 204 (1) 1 - 47, 2010. https://doi.org/10.1007/s11511-010-0044-9
Information