Skip to content

Erdős Problem #729

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: number theory, factorials.

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 every fixed C>0, are there infinitely many positive integers a,b,n with a+b>n+C log n, where the denominator of n!/(a!b!) in reduced form contains only prime factors bounded by a constant K depending on C but NOT on a,b,n? The maintained source says PROVED (externally LEAN-reported). This is not the same as n!/(a!b!) being integral, and K cannot depend on n.

A small example

Take a=4,b=4,n=6: n!/(a!b!)=720/576=5/4, so the denominator has only prime factor 2. This is a finite control illustrating the reduced denominator, but is not a witness to every C or infinitude. For a=b=n≥3, n!/(a!b!)=1/n!, whose denominator includes arbitrarily large primes, showing the trivial #728 witness does NOT carry to #729.

What is known

The maintained catalogue attributes a 2026 affirmative proof to Kevin Barreto and Leeham using ChatGPT-5.2 and Aristotle adapting #728. Pinned FormalConjectures/ErdosProblems/729.lean encodes ∀C>0 ∃K≥3 with an INFINITE set of triples and no denominator prime p>K; the statement has a sorry body and links an external formal proof at plby/lean-proofs. No GCL source-hash/axiom replay completed. Its valuation criterion can be written v_p(n!)-v_p(a!)-v_p(b!)≥0 for all p>K. The exponent of small primes may be negative without violating the claim. History EGRS75 original statement not fully inspected.

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: 2026 external barreto leeham proved lean reported; c dependent k bound uniformly over triples; gcl formal kernel unreplayed. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

ERDOS-729-REDUCED_DENOMINATOR_INTERFACE. Prove p-adic equivalence for the rational denominator, inspect external #729 Lean proof hashes/axioms and independent authorship/review claims, and source-lock C-dependent K. A finite p=2 example is a sanity fixture, not an asymptotic theorem.

Sources and claim boundaries

Maintained Erdős #729; authenticated original source return; GCL-pinned formal statement. Original historical proof pages and external Lean environment uninspected. source-qualified editorial review recorded.

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: #2000 — 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