ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G(X)G(X) denote the largest gap between consecutive primes not exceeding XX, and let log⁡j\log_j denote the jj-fold iterated logarithm. The paper proves that, for all sufficiently large XX,

G(X)≫log⁡X (log⁡2X)2 log⁡4X(log⁡3X)2.G(X)\gg \frac{\log X\,(\log_2 X)^2\,\log_4 X}{(\log_3 X)^2}.

Equivalently, there is an absolute constant c>0c>0 such that G(X)G(X) is at least cc times the quantity above for all sufficiently large XX. This improves Rankin's classical lower bound by a factor of log⁡2X\log_2 X.

Record

Added
Links

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.