Erdős Problem #680
Editorial depth: Reviewed explanatory article — evidence qualified.
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.
The question in plain language
How far after an integer \(n\) must we look to encounter another integer having no small prime divisor relative to the distance traveled? Write \(p(r)\) for the least prime factor of \(r\geq2\). The first part of Erdős #680 asks whether every sufficiently large \(n\) has some positive \(k\) for which \(p(n+k)>k^2+1\). Here \(n+k\) may itself be prime. A second, sharper question asks whether a threshold of the form \(\exp((1+\varepsilon)\sqrt{k})+C_{\varepsilon}\) is too demanding in a precise quantified sense. Both questions are OPEN.
A small example
Let \(n=10\) and \(k=1\). Then \(n+k=11\) is prime, so its least prime factor is \(11\), larger than \(1^2+1=2\). A composite example is \(n=8,k=1\), where \(n+k=9\) has least prime factor \(3>2\). A finite witness is easy to inspect but tells us nothing about every sufficiently large starting integer.
What is known
For a prime number \(r\), \(p(r)=r\). For a composite \(r\), one always has \(p(r)\leq\sqrt r\). Thus searching for a witness can use prime occurrences or much rarer rough composites. Erdős noted an implication of strong conjectures about prime gaps, attributed on the maintained page to Cramér's heuristic, but these gap models and Granville's refined correction are not unconditional proofs. The second part of #680 is a proposed upper boundary for the possible least prime factors. Its logical negation of an eventual existential assertion cannot be replaced by a single small numerical counterexample. Problem #681 adds the explicit requirement that \(n+k\) be composite, and must not be substituted for this problem.
GCL's current state
The original authenticated RESULT/1 source return has historical disposition PARTIAL. This status and the original research exceptions are preserved, not silently converted into a theorem verdict. The maintained Erdős source and source-specific mathematical definitions were reviewed, and this article is editorially reviewed as a source-exception-annotated explanation under EC-BULK-005-R10, effective only after the exact-hash protected admission merges.
Source interpretation and unresolved mathematical qualification: Problem #680 admits prime witnesses; composite-only problem #681 and pinned sorry-targets are distinct; gap heuristics are not theorems.
The explanation is accepted for publication of established background, examples, and explicitly attributed current claims. It does not establish or formally certify the disputed original theorem, external model-assisted proof, historical interpretation, or any unreplayed Lean kernel file. Original source-fidelity and proof-review research holds remain.
What remains
A bounded next task is to turn one explicitly stated hypothesis on gaps between consecutive primes into a correct implication for the first #680 question, keeping track of the choice of \(k\) and its relation to \(n\). Exact trial-division searches can validate finite witnesses and falsify a proposed short-range lemma; they cannot establish asymptotic universality. Critical source review, protected publication, deployed MathJax inspection and exact-hash V2 admission are outstanding.
Sources and claim boundaries
Maintained Erdős #680, pinned GCL formal source, and authenticated GCL return. Er79d original primary text and Cramér/Granville technical sources not independently checked. Original Erdős text and prime-gap proof sources remain unverified; no conjecture proof or kernel certificate is claimed.
Qualified editorial critical review: R10 source-exception dossier. The source-semantic exception is visible and its original research hold remains. Publication classification: REVIEWED EXPLANATORY ARTICLE WITH UNRESOLVED SOURCE/PROOF QUALIFICATIONS. Independent theorem proof or Lean certification: NOT CLAIMED.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1951 — 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.