Erdős Problem #681
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 soon after an arbitrary large integer \(n\) can we find a composite number all of whose prime factors are much larger than the distance traveled? Erdős #681 asks whether, for every sufficiently large \(n\), some integer \(k>0\) satisfies \(n+k\) composite and \(p(n+k)>k^2\), where \(p(r)\) is the least prime factor. The composite requirement is essential. Problem #680 asks a related question but allows prime values of \(n+k\).
A small example
For \(n=8,k=1\), the number \(n+k=9=3^2\) is composite and its least prime factor is \(3>1^2\), so it is a valid witness. In contrast, for \(n=10,k=1\), the candidate \(11\) is prime and therefore does not qualify for #681, even though its least prime factor is large. A small example cannot prove the universal assertion.
What is known
If \(r=n+k\) is composite with smallest prime divisor \(p(r)>k^2\), write \(r=p(r)q\). The other factor \(q\) is at least \(p(r)\), so \(n+k=r\geq p(r)^2>k^4\). Any composite witness must satisfy this simple size inequality. The converse fails: a large number can still have a very small prime factor. This gives a bounded search region for \(k\), but not a proof of existence. The maintained source describes an Erdős–Eggleton–Selfridge question and suggests that perhaps \(k^2\) could be replaced by \(k^d\) for any fixed \(d\). That is explicitly conjectural.
GCL's current state
The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.
Preserved source-review qualifications: composite witness required; pinned fc sorry; necessary k4 size not sufficient. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
A useful bounded investigation starts with the necessary window \(k^4<n+k\), uses exact integer factorization to generate finite composite rough-number fixtures, and then asks whether a named sieve or almost-prime theorem controls suitable numbers in those windows for every sufficiently large \(n\). A finite search or a prime-only argument cannot resolve the question. Complete original-source review, editorial critical review, protected merge, deployed mathematical typesetting readback and V2 admission remain due.
Sources and claim boundaries
Maintained #681; GCL-pinned #681 formal statement; authenticated source audit. Historical [Er79d] primary passage not directly inspected. Unaccepted article; no mathematical solution, Lean certification, protected publication, browser MathJax verification or editorial admission.
Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1952 — 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.