Erdős Problem #711
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory.
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
Erdős #711 concerns f(n,m), the least F such that the OPEN interval (m,m+F) contains n distinct integers a_1,...,a_n, each a_k divisible by k. The first question asks max_m f(n,m)≤n^(1+o(1)). The second asks whether max_m(f(n,m)−f(n,n)) grows without bound. The maintained problem is still OPEN because the first question remains unresolved; the second has an attributed proof.
A small example
For n=1, the open interval (m,m+2) contains m+1 and is minimally long, so f(1,m)=2. For n=2, (m,m+3) contains exactly m+1 and m+2; one is even and the other can be used for a_1, so f(2,m)=3. Thus the first two small values have no offset-sensitive excess at all. The source's divergence is an n→∞ statement.
What is known
The source credits Erdős–Pomerance [ErPo80] with max_m f(n,m)≪n^(3/2), and two-sided bounds for the special starting point f(n,n). It reports that Wouter van Doorn [vD26] proved the SECOND question positively, showing for all sufficiently large n there exists an offset m with f(n,m)−f(n,n)≫n log n/loglog n. That quantitative result does not imply max_m f(n,m)≤n^(1+o(1)), and the original source remains open in that respect. Original [ErPo80] and [vD26] theorem pages are not independently inspected in this audit.
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: second part vandoorn2026 source proved; first uniform upper open; vandoorn primary proof not replayed. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Reproduce the finite Hall-matching model for open intervals, inspect vD26's theorem and its offset construction, then derive one accurately quantified corollary. Keep the open first part separate from the completed second. Protected source review, merge, browser MathJax testing and V2 admission remain.
Sources and claim boundaries
Maintained Problem #711; authenticated GCL result; historical [ErPo80],[Er92c] and vD26 original proof pages not independently reviewed. No new result, protected publication 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: #1982 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: STATEMENT_CAPTURE_REQUIRED.
- 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.