Long gaps between primes

From MaRDI portal



Abstract: Let pn denotes the n-th prime. We prove that max_{p_{n+1} leq X} (p_{n+1}-p_n) gg frac{log X log log Xloglogloglog X}{log log log X} for sufficiently large X, improving upon recent bounds of the first three and fifth authors and of the fourth author. Our main new ingredient is a generalization of a hypergraph covering theorem of Pippenger and Spencer, proven using the R"odl nibble method.




Cites work


Cited in
(45)








This page was built for publication: Long gaps between primes

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