Large gaps between primes

From MaRDI portal



Abstract: We show that there exists pairs of consecutive primes less than x whose difference is larger than t(1+o(1))(logx)(loglogx)(loglogloglogx)(logloglogx)−2 for any fixed t. Our proof works by incorporating recent progress in sieve methods related to small gaps between primes into the Erdos-Rankin construction. This answers a well-known question of Erdos.




Cited in
(48)








This page was built for publication: Large gaps between primes

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