Erdős Problem #731
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory, binomial coefficients.
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
For n≥1 write B(n) = \(\binom{2n}{n}\). Let m(n) be the LEAST positive integer m with m NOT dividing B(n). Erdős–Graham–Ruzsa–Straus ask for an asymptotic equivalent \(m(n)\sim f(n)\) for almost all n. The maintained problem is OPEN: an order-of-magnitude statement on a logarithmic scale does not provide a specific asymptotic f(n).
A small example
For n=1, B(1)=2 and the least positive nondivisor is m(1)=3; n=2 B(2)=6 and m(2)=4; n=3 B(3)=20 and m(3)=3; n=4 B(4)=70 and m(4)=3. These are exact finite values, not evidence for a normal-order theorem. Note the least nondivisor is not necessarily prime: m(2)=4.
What is known
The maintained source attributes to original EGRS75 the almost-all estimate \(m(n)=\exp((\log n)^{1/2+o(1)})\). This quantifies the approximate logarithmic GROWTH exponent for a density-one set of n; it does NOT provide a function f(n) with ratio \(m(n)/f(n)\to1\). The OEIS A006197 describes the sequence but cannot prove a nearly-all asymptotic. Exact computation can use binomial valuations: m divides B(n) iff v_p(m)≤v_p(B(n)) for every prime p|m. That is a deterministic algorithm, not a solution of the distribution of m(n).
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 multiplicative asymptotic equivalent; known logarithmic normal order weaker; least nondivisor composite allowed. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
ERDOS-731-FIRST_NON_DIVISOR_DENSITY. Implement exact m(n) for n≤1000 using valuation vectors and compare to direct binomial modulus; source-lock original EGRS75 'almost all' quantifiers. Propose a genuinely specific candidate normal-order function only after proving concentration on the multiplicative scale; finite numerical fits do not settle the question.
Sources and claim boundaries
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: #2002 — 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.