Skip to content

Erdős Problem #1137

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory, primes.

Read this status correctly

The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.

UNACCEPTED DRAFT — mathematical editorial review pending

This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.

Review the underlying draft on GitHub.

The question in plain language

Prime numbers have irregular gaps. Sometimes two comparatively large gaps occur consecutively. Erdős Problem #1137 asks whether the product of two consecutive gaps is always small relative to the square of the largest single gap, in the limit.

Let \(p_n\) be the \(n\) th prime and let

\[ d_n=p_{n+1}-p_n. \]

The conjecture is

\[ \frac{\max_{2\le n<x}d_{n-1}d_n} {\bigl(\max_{1\le n<x}d_n\bigr)^2} \longrightarrow0. \]

The original formula uses a cutoff on the index \(n\), not on the numerical size of the prime.

A small example

Among the 2,262 primes up to 20,000, the largest gap between consecutive primes in that list is \(52\). The largest product of neighboring gaps is \(1,040\). Their finite ratio is

\[ \frac{1040}{52^2}=\frac5{13}. \]

This computation is a bounded prime-value diagnostic rather than the original index cutoff. It illustrates the relative scale but cannot prove or refute a limiting ratio.

The numerator uses neighboring gaps, whereas the denominator can be determined by a completely different record gap.

What is known

The problem remains open according to the maintained catalogue, citing Vardi's 1999 prime census.

Probabilistic heuristics, such as treating suitably normalized consecutive gaps as approximately independent exponential random variables, motivate conjectures about record gaps. They are heuristics, not rigorous bounds on the occurrence or adjacency of large prime gaps.

The asymptotic behavior of maximal gaps is itself a difficult problem, so the extra condition about two neighboring large gaps requires additional information.

GCL's current state

Authenticated issue audit #2408 records the difference between index and prime-value cutoffs. An exact sieve-based diagnostic verifies the finite ratio above.

What remains

Source-review Vardi's original index convention, independently examine the behavior near record prime gaps over larger provable ranges, and separate numerical evidence and probabilistic models from unconditional asymptotic theorems.

Sources and claim boundaries

Erdős #1137; Vardi (1999), Problem 1.2; GCL source audit. Finite prime-gap arithmetic is independently checked. The asymptotic remains open. Unaccepted draft.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2408 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: PROTECTED_READY_BACKLOG.
  • Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
  • External mathematical status: consult current problem page and its dated bibliography.

Back to catalogue · Compendium introduction