Erdős Problem #710
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
Let f(n) be the least positive integer such that in the OPEN interval (n,n+f(n)) one can choose n DISTINCT integers a_1,...,a_n satisfying k|a_k for k=1,...,n. Erdős–Pomerance ask for an asymptotic formula for f(n), not merely big-O upper and lower bounds. The maintained problem #710 remains OPEN; the fact that the interval is open at both ends changes finite fixtures by one.
A small example
For n=1 the interval (1,3) contains integer 2, giving f(1)=2; (1,2) contains none. For n=2, (2,5) contains 3 and 4, allowing a_1=3,a_2=4, so f(2)=3. For n=3, (3,7) contains 4,5,6; assign a_1=5,a_2=4,a_3=6, giving f(3)=4. For n=4, the interval (4,9) contains exactly 5,6,7,8, but a_3 must be 6 and a_4 must be 8, leaving no even unused number for a_2, so f(4)>5; (4,10) gives a_1=5,a_2=6,a_3=9,a_4=8, proving f(4)=6. These examples are exact finite matching certificates.
What is known
Maintained source attributes to Erdős and Pomerance [ErPo80] the bounds (2/sqrt(e)+o(1))n sqrt(log n/loglog n) ≤ f(n) ≤ (1.7398...+o(1)) n sqrt(log n). These do not match to a single asymptotic leading term. There is a direct relation f(n)=f(n,n) to #711's offset-parameter function, but #711 is not fully resolved. Historical Erdős 1992 prize offer is not a mathematical status. Full original ErPo80 primary proof pages were not independently checked.
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: open interval endpoints finite fixtures; f n sharp asymptotic open. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Use a bipartite matching formulation with left constraints k=1..n and right candidates in (n,n+F), then produce exact Hall certificates for n≤10. Audit primary ErPo80 bound hypotheses and prove one finite necessary-window lemma; no extrapolation from finite f(n) table to asymptotic constant.
Sources and claim boundaries
Maintained Problem #710; GCL original source report. ErPo80 and Er92c complete source proofs remain uninspected; no new independent primary theorem certification, deployed browser mathematics check or V2 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: #1981 — 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.