Erdős Problem #849
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
Binomial coefficients can occur in multiple rows of Pascal's triangle. Once column symmetry is removed, do any coefficients occur arbitrarily many times? Concrete multiplicities three and four are known; no examples with multiplicity five are known.
For positive integer t ask whether there exists an integer a attained by binomial(n,k) in EXACTLY t ordered (n,k) pairs with 1<=k<=n/2. This symmetry-normalized domain counts each pair in Pascal's triangle only once, and includes the k=1 boundary. The main existential every-t formulation is OPEN; Singmaster conjectured a UNIVERSAL bound on the multiplicity, which would make the original answer NO for sufficiently large t.
A small example
For a=120 the three counted pairs are (10,3),(16,2),(120,1). For a=3003 the four pairs are (14,6),(15,5),(78,2),(3003,1). These can be verified exactly and show why k=1 boundary matters.
This finite calculation tests definitions, not a result quantified over all large N or infinite sets.
What is known
Maintained https://www.erdosproblems.com/latex/849 read 2026-10-14 credits Erdős/Gordon and Singmaster. Counts t=3 at a=120 and t=4 at a=3003; no t>=5 examples known. Matomäki–Radziwiłł–Shao–Tao–Teräväinen [MRSTT22], Singmaster's conjecture in the interior of Pascal's triangle, Quarterly J Math 2022 1137–1177, prove at most two when k>=exp((log n)^(2/3+epsilon)) and a sufficiently large depending on epsilon. Restricted interior theorem does not settle k small/boundary or all t.
The convention counts integer pairs \((n,k)\) satisfying \(1\leq k\leq n/2\) and \(\binom{n}{k}=a\), including \(k=1\). For \(a=120\) the three pairs are \((10,3),(16,2),(120,1)\). For \(a=3003\) the four are \((14,6),(15,5),(78,2),(3003,1)\). Removing \(k=1\) would invalidate the quoted multiplicities. The interior-of-Pascal theorem applies only to its specified lower restriction on k, not to every pair in the triangle.
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 singmaster multiplicity t geq5. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Exact enumerate binomial coefficients including n=a,k=1, efficient stop when choose(n,2)>a for n not a, verify counts. Source lock interior 2022 theorem uniformity and source examples, preserve OPEN for t>=5.
Before acceptance, independently verify source theorem hypotheses and proof fidelity, check displayed mathematics in a deployed browser, and submit a protected editorial admission. No such admission is recorded here.
Sources and claim boundaries
- Erdős problem #849 and maintained LaTeX/bibliography, read 14 October 2026.
- Authenticated source-audit return, including mathematical scope and outstanding primary-paper obligations.
- Pinned teorth/erdosproblems revision 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml; external proof claims not independently certified by GCL.
- Critical review: PENDING. Protected publication: NOT MERGED. Deployed MathJax: NOT VERIFIED. Formal theorem replay: NONE.
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: #2120 — 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.