Erdős Problem #727
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (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 integer k≥2, are there infinitely many n such that ((n+k)!)² divides (2n)!? The maintained #727 says OPEN EVEN for k=2; the case k=1 is classically proved. The factorials have to satisfy n≥k for the quotient to be nontrivial; finite checks never prove infinitely many n.
A small example
Use Legendre's formula v_p(m!)=Σ_{j≥1}floor(m/p^j). The divisibility condition is equivalent for every prime p≤2n to Δ_p(n,k)=v_p((2n)!)-2v_p((n+k)!)≥0. For k=2,n=3 one has (5!)²=14400, (6)!=720, so divisibility FAILS. For k=2,n=2 it also fails. One cannot infer permanent failure from these fixtures.
What is known
Balakran [Ba29] proved infinitely many n for k=1, equivalent to (n+1)² dividing central binomial coefficient C(2n,n). Erdős–Graham–Ruzsa–Straus [EGRS75] proved a weaker crossed condition (n+k)!(n+1)!|(2n)! infinitely often for each fixed k, with a logarithmic k range in their original statement. The GCL-pinned FormalConjectures #727 includes main, k=2, k=1, and crossed-condition statements; all theorem bodies remain sorry despite a known classical k=1 result. This is not a Lean GCL proof certificate. Full original Er68c/EGRS75 papers uninspected.
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: factorial k2 infinitude open; k1 only proved; pinned fc main sorry. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
ERDOS-727-VALUATION_FINITE_FILTER. Implement exact Δ_p(n,k) for p≤2n and k=1,2,3 through n≤1000; produce exact passing/failing cases with a prime valuation witness, then inspect original Balakran proof of k=1 and the exact EGRS75 crossed condition. Acceptance: exact valuation lemma and source-cited historical theorem, no infinitude inference from scan.
Sources and claim boundaries
Maintained Erdős #727; 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: #1998 — 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.