We show that there exist 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. This answers a well-known question of Erdős.
No takes yet. Share an insight, caveat, or question.
James Maynard (2016) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: