We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that there are infinitely often primes differing by 16 or less. Even a much weaker conjecture implies that there are infinitely often primes a bounded distance apart. Unconditionally, we prove that there exist consecutive primes which are closer than any arbitrarily small multiple of the average spacing, that is, \[ \liminf_{n\to \infty} \frac{p_{n+1}-p_n}{\log p_n} =0 .\] We will quantify this result further in a later paper.
Daniel A. Goldston  1 ; János Pintz  2 ; Cem Y. Yíldírím  3
@article{10_4007_annals_2009_170_819,
author = {Daniel A. Goldston and J\'anos Pintz and Cem Y. Y{\'\i}ld{\'\i}r{\'\i}m},
title = {Primes in tuples {I}},
journal = {Annals of mathematics},
pages = {819--862},
year = {2009},
volume = {170},
number = {2},
doi = {10.4007/annals.2009.170.819},
mrnumber = {2552109},
zbl = {1207.11096},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.4007/annals.2009.170.819/}
}
TY - JOUR AU - Daniel A. Goldston AU - János Pintz AU - Cem Y. Yíldírím TI - Primes in tuples I JO - Annals of mathematics PY - 2009 SP - 819 EP - 862 VL - 170 IS - 2 UR - http://geodesic.mathdoc.fr/articles/10.4007/annals.2009.170.819/ DO - 10.4007/annals.2009.170.819 LA - en ID - 10_4007_annals_2009_170_819 ER -
Daniel A. Goldston; János Pintz; Cem Y. Yíldírím. Primes in tuples I. Annals of mathematics, Tome 170 (2009) no. 2, pp. 819-862. doi: 10.4007/annals.2009.170.819
Cité par Sources :