Improved maximal prime-gap lower bound
Statement
Let denote the largest gap between consecutive primes not exceeding , and let denote the -fold iterated logarithm. The paper proves that, for all sufficiently large ,
Equivalently, there is an absolute constant such that is at least times the quantity above for all sufficiently large . This improves Rankin's classical lower bound by a factor of .
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.