Large gaps between primes

From MaRDI portal
Publication:291018

DOI10.4007/ANNALS.2016.183.3.3zbMATH Open1353.11099arXiv1408.5110OpenAlexW2621293163WikidataQ60043293 ScholiaQ60043293MaRDI QIDQ291018FDOQ291018


Authors: James Maynard Edit this on Wikidata


Publication date: 6 June 2016

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1408.5110




Recommendations




Cites Work


Cited In (43)





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)