Skip to content

Erdős Problem #682

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (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.

The question in plain language

Between two consecutive primes \(p_j<p_{j+1}\), is there typically an integer that has no prime factor smaller than the gap length? Erdős Problem #682 asks whether for almost all prime gaps of length \(g=p_{j+1}-p_j\) some integer \(m\) strictly between them has \(p(m)\geq g\), where \(p(m)\) denotes the least prime factor. The answer is yes. Ayla Gafni and Terence Tao proved it in 2025–2026.

A small example

The consecutive primes \(7\) and \(11\) have gap length \(4\). Their interior points are \(8,9,10\), whose least prime factors are \(2,3,2\), all smaller than \(4\). That gap is exceptional. The consecutive primes \(11\) and \(13\) have gap length \(2\), with interior integer \(12\) and least prime factor \(2\). This gap qualifies, because the statement uses \(\geq\), not strict \(>\). A seemingly minor inequality sign changes the treatment of every twin-prime gap.

What is known

The directly inspected primary paper Gafni–Tao, Rough numbers between consecutive primes, Theorem 1.1, proves that if \(N(X)\) counts exceptional prime gaps whose left endpoint lies in \([X,2X]\), then \(N(X)\ll X/(\log X)^2\). The prime number theorem gives about \(X/\log X\) primes in that interval, so the exceptional proportion is \(O(1/\log X)\) and tends to zero. This proves Erdős's almost-all question. The paper also proves, assuming a precise form of the Dickson–Hardy–Littlewood prime tuples conjecture, an asymptotic \(N(X)\sim cX/(\log X)^2\) for a positive constant \(c\). That stronger formula is conditional. It remains unknown unconditionally whether infinitely many exceptional gaps exist. Erdős suggested such exceptions via arithmetic progressions with endpoints \(2183+30030d\) and \(2201+30030d\), conditional on the endpoints being primes; \(d=0\) is not itself a pair of consecutive primes.

GCL's current state

The authenticated original RESULT/1 source return retains its original BOUNDED_TASK_DESIGNED disposition and mathematical qualifications. This source-grounded explanation is editorially reviewed through the exact-hash EC-BULK-005-R8 protected transaction, effective on protected merge. It is not a fresh proof of the attributed mathematical theorem or an internally replayed Lean certificate.

Critical source-scope distinction: Gafni–Tao almost all prime gaps: least prime factor >=gap; exceptional gaps possible, >= not strict >.

What remains

For source closure, align Gafni–Tao's definition of \(N(X)\), their theorem and two remarks with the historical Erdős formulation. If strict \(p(m)>g\) is discussed, account separately for the twin-prime contribution. Distinguish the proved density-one statement from the still-open unconditional infinitude of exceptions and the prime-tuples conditional asymptotic. Then complete critical editorial review, protected merge, public mathematics rendering inspection and separate V2 admission.

Sources and claim boundaries

Gafni and Tao, Rough numbers between consecutive primes, Theorem 1.1 and Remarks 1.1–1.2 directly read; maintained #682; authenticated original issue audit. The original Erdős 1979 scan and full technical proof chain were not independently reverified. No new theorem proof or formal certificate is claimed.

Editorial provenance: protected R8 source-critical review. Original issue-level source and research-proof holds remain. Status: REVIEWED explanatory article; full historical theorem proofs, unresolved conjectures and external Lean proofs are not newly certified.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1953 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
  • Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider 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