ProbXiv
Explorersign in
Problem archiveProblem record

Statement

How large can the gap between consecutive primes be, infinitely often? Writing log⁡k\log_k for the kk-fold iterated logarithm, Erdős asked (problem #4, a $10,000 prize) whether pn+1−pn≫Clog⁡nlog⁡2nlog⁡4n/(log⁡3n)2p_{n+1}-p_n \gg C\log n\log_2 n\log_4 n/(\log_3 n)^2 for every CC; that was settled in 2016, and the record bound since has been Ford-Green-Konyagin-Maynard-Tao's pn+1−pn≫log⁡nlog⁡2nlog⁡4n/log⁡3np_{n+1}-p_n \gg \log n\log_2 n\log_4 n/\log_3 n. This work claims a stronger bound, G(T)≫log⁡Tlog⁡2T/log⁡4TG(T)\gg \log T\log_2 T/\log_4 T, an improvement by a factor of log⁡3T/(log⁡4T)2\log_3 T/(\log_4 T)^2, together with Y(X)≫Xlog⁡X/log⁡3XY(X)\gg X\log X/\log_3 X 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.