Erdős Problem #698
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (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
Erdős and Szekeres asked whether the greatest common divisor of every two distinct binomial coefficients C(n,i) and C(n,j), with 2≤i<j≤n/2, is bounded below by a quantity h(n) tending to infinity uniformly in i,j. The maintained source lists PROVED, externally LEAN-reported. George M. Bergman's 2011 work supplies a much stronger explicit bound, not merely gcd>1.
A small example
At n=10,i=2,j=3, C(10,2)=45 and C(10,3)=120, so gcd=15. At n=12,i=2,j=4, C(12,2)=66 and C(12,4)=495, so gcd=33. These are exact examples of the common-divisor phenomenon, not proofs that the minimum over all indices grows indefinitely.
What is known
PRIMARY PUBLISHER SOURCE inspected: George M. Bergman, 'On common divisors of multinomial coefficients', Bulletin of the Australian Mathematical Society 83 (2011), 138–157, DOI 10.1017/S0004972710001723, theorem 2/section 2. The published bound is gcd(C(n,i),C(n,j)) ≥ n^(1/2)·2^(i−7/2)/(i·sqrt(i−1)) for 2≤i≤j≤n/2, thus at least a positive absolute multiple of sqrt(n), uniformly in i because 2^i/i^(3/2) has a positive minimum for i≥2. The maintained catalogue uses asymptotic notation gcd ≫ sqrt(n)2^i/i^(3/2). The source reports external Lean verification, but the protected GCL Formal Conjectures snapshot contains no #698 file; exact external proof/axiom replay not done.
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: bergman published uniform gcd lower; external lean not gcl replayed. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Read Bergman's original proof of theorem 2, verify exact numerical constant and quantifiers, and derive explicitly a uniform h(n)=c sqrt(n) independent of i,j (for n with nonempty index range). Validate n=10 and n=12 integer gcd fixtures and compare theorem target to any external Lean formalization. Stop at one source-proof interface; no GCL certificate without kernel/dependency audit.
Sources and claim boundaries
Maintained Erdős Problem #698; https://www.erdosproblems.com/698 ; https://doi.org/10.1017/S0004972710001723 ; Bergman author version https://math.berkeley.edu/~gbergman/papers/nomial.pdf (PDF not page-by-page inspected in this task). GCL return. Primary complete proofs and exact historical passages remain incompletely reviewed. no new independent primary theorem certification PR merge, deployed MathJax/browser proof, or V2 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: #1969 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- 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.