Primes in tuples. I

From MaRDI portal
(Redirected from Publication:731202)




Abstract: 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 o infty} frac{p_{n+1}-p_n}{log p_n} =0 .] This last result will be considerably improved in a later paper.



Cites work


Cited in
(only showing first 100 items - show all)






This page was built for publication: Primes in tuples. I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q731202)