Prime Gaps at Most 186
Statement
For the sequence of primes , the project derives More precisely, assuming three explicit analytic/numerical inputs, it proves : every admissible set of forty integer shifts has infinitely many translates containing at least two primes. Applying this to an explicit admissible -tuple of diameter yields infinitely many consecutive prime gaps of size at most . 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
- Source
- Added
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.