Skip to content

Erdős Problem #730

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: solved (not automatically the live result).
Subject areas: number theory, binomial coefficients, base representations.

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 positive integers n≠m, can the two central binomial coefficients \(\binom{2n}{n}\) and \(\binom{2m}{m}\) have exactly the SAME SET of prime divisors for infinitely many distinct ordered pairs? The maintained #730 now reports a solution by GPT Pro prompted by Price, with quantitative lower bounds for neighboring central-binomial prime-support coincidences. This is a reported model-assisted proof, not an independently replayed mathematical or Lean certificate. Frozen and current catalogue status must be distinguished. Finite examples alone do not prove infinitude.

A small example

The maintained page gives distinct pairs \((n,m)=(87,88)\) and (607,608), and a three-way coincidence at 10003,10004,10005. The protected Formal Conjectures #730.lean actually contains concrete proof bodies for the two small pairs and for (10003,10005), while its MAIN infinitude conjecture is answer(sorry)/by sorry. Equality of PRIME SUPPORT means only whether a prime divides each coefficient, NOT equality of the coefficients or exponents.

What is known

A prime p divides \(\binom{2n}{n}\) iff adding n+n in base p has at least one carry (Kummer's theorem). Equivalently \(v_p(\binom{2n}{n})>0\) by Legendre. This offers exact finite support enumeration, and the pair (87,88) can be directly checked without materializing a new theorem. Protected FC #730 at google-deepmind/formal-conjectures@85f863718beeec7b58a3a1926ee92e3472bc2020 labels the main infinite-pairs theorem research OPEN while proving examples; the live maintained page now attributes a solution to GPT Pro (prompted by Price), whereas the pinned main infinitude proof body remains unproved. The current external full-strength argument has not been independently reproduced by GCL. An external September 2026 Formal Conjectures issue #5239 reports status-sync confusion. Primary EGRS75 pages uninspected.

GCL's current state

The original authenticated RESULT/1 source return has historical disposition STATUS_CONFLICT. This status and the original research exceptions are preserved, not silently converted into a theorem verdict. The maintained Erdős source and source-specific mathematical definitions were reviewed, and this article is editorially reviewed as a source-exception-annotated explanation under EC-BULK-005-R10, effective only after the exact-hash protected admission merges.

Source interpretation and unresolved mathematical qualification: The maintained source reports solved infinite common-prime-support pairs, but pinned formal parent remains sorry and finite Kummer examples cannot settle infinitude.

The explanation is accepted for publication of established background, examples, and explicitly attributed current claims. It does not establish or formally certify the disputed original theorem, external model-assisted proof, historical interpretation, or any unreplayed Lean kernel file. Original source-fidelity and proof-review research holds remain.

What remains

ERDOS-730-STATUS_AND_KUMMER_RECONCILIATION. Compare historical 1975 question, pinned solved register and current model-assisted solution claim and pinned Lean metadata; enumerate exact prime supports for (87,88) and (607,608) using Kummer/Legendre and verify the two protected Lean finite-example results. Acceptance is source status chronology and finite equal-support certificate; do not claim infinitude or admit until categorical status is reconciled.

Sources and claim boundaries

Maintained Erdős #730; original source audit. Primary EGRS75 theorem pages have not been independently inspected. Protected source publication and live browser rendering of this draft have occurred. Independent proof review and exact-hash V2 admission remain outstanding.

Qualified editorial critical review: R10 source-exception dossier. The source-semantic exception is visible and its original research hold remains. Publication classification: REVIEWED EXPLANATORY ARTICLE WITH UNRESOLVED SOURCE/PROOF QUALIFICATIONS. Independent theorem proof or Lean certification: NOT CLAIMED.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2001 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
  • 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.

Back to catalogue · Compendium introduction