ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For the sequence of primes pnp_n, the project derives lim inf⁡n→∞(pn+1−pn)≤186.\liminf_{n\to\infty}(p_{n+1}-p_n)\le186. More precisely, assuming three explicit analytic/numerical inputs, it proves DHL[40,2]\mathrm{DHL}[40,2]: every admissible set of forty integer shifts has infinitely many translates containing at least two primes. Applying this to an explicit admissible 4040-tuple of diameter 186186 yields infinitely many consecutive prime gaps of size at most 186186. The Lean development verifies the deduction from the stated inputs; the two Kloosterman-type estimates and the finite physical-integral/cap bounds remain external assumptions.

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.