A tilted residue-class construction for long prime-free intervals
Statement
How large can the gap between consecutive primes be, infinitely often? Writing for the -fold iterated logarithm, Erdős asked (problem #4, a $10,000 prize) whether for every ; that was settled in 2016, and the record bound since has been Ford-Green-Konyagin-Maynard-Tao's . This work claims a stronger bound, , an improvement by a factor of , together with for the covering problem behind it.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.