Skip to content

Erdős Problem #728

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

The maintained #728 asks for infinitely many a,b,n with a,b≥ε n, a! b! dividing n! (a+b−n)! and a+b>n+C log n. AS WRITTEN it is trivial: taking a=b=n gives equality of both factorial products and a+b=2n>n+C log n for sufficiently large n (for fixed ε<1). The intended near-central nontrivial condition a,b≤(1−ε)n and a+b−n≈C log n is not included in that literal statement. The catalogue reports an external Barreto / GPT-5.2 Pro / Aristotle proof of a strengthened version; do not conflate it with the trivial literal existence.

A small example

For any n≥2 take a=b=n: a!b!=n!n! and n!(a+b−n)!=n!n!, so divisibility holds exactly. If 0<ε≤1, both lower conditions hold. For fixed C>0, n>C log n eventually, hence a+b=2n>n+C log n. This supplies infinitely many literal examples without invoking the external theorem, but does not address a,b≈n/2.

What is known

The source records stronger nontrivial examples b=n/2, a=n/2+O(log n), with C1 log n < a+b−n < C2 log n for arbitrary 0<C1<C2, attributed to Barreto and ChatGPT-5.2 and externally formalized by Aristotle. The GCL-pinned FormalConjectures #728.lean uses this stronger bounded-log excess target and its parent body is sorry; its theorem is not logically equivalent to the trivial maintained literal form. No external Lean proof was replayed by GCL. The EGRS75 original problem wording and range assumptions require primary source lock.

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 literal a=b=n instance is trivial, unlike the externally claimed near-central bounded-log factorial divisibility theorem; pinned Lean is not proof.

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-728-LITERAL_VS_INTENDED. Record the elementary a=b=n trivial witness, formal-target stronger two-sided logarithmic excess, and exact ε,C quantifiers. Source-check original EGRS75 p.91 and externally reported Barreto certificate including axioms. Produce an exact implication table; do not claim the literal proof independently proves the strengthened research theorem.

Sources and claim boundaries

Maintained Erdős #728; authenticated original source return; GCL-pinned formal statement. Original historical proof pages and external Lean environment uninspected. the exact-hash explanatory admission is R10.

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