Skip to content

Erdős Problem #699

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: falsifiable (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

Erdős and Szekeres ask whether, whenever 1≤iErdős Problem #699, listed as **FALSIFIABLE** rather than resolved. The strict condition p>i is a different historical strengthening.

A small example

For n=28,i=5,j=14, exact arithmetic gives gcd(C(28,5),C(28,14))=1080=2³·3³·5. The largest prime factor is p=5, equal to i. Thus the weak p≥i condition is satisfied, while p>i fails. This is an example of why the inequality sign cannot be changed. A finite check for n≤60 found no violation of the weak condition, but this is not a proof.

What is known

Sylvester–Schur ensures that C(n,i) has a prime divisor greater than i for i≤n/2. It does not imply that this same prime also divides C(n,j). The GCL-pinned formal statement distinguishes the main weak condition from a strict finite-exception variant. Its main formal proposition still contains a proof hole. No complete formal certificate is available from that pinned file.

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: weak ge i falsifiable not refuted; strict gt i counterexample n28 i5 j14; pinned fc sorry. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

A bounded successor is a certified finite search and a prime-valuation reduction for a hypothetical counterexample, preserving p≥i and i<j≤n/2. The original Erdős–Szekeres 1978 paper needs direct source review. Then undertake protected critical editorial review, mathematical rendering checks and separate V2 admission.

Sources and claim boundaries

Maintained #699; pinned Lean statement; original issue source audit. No solution, GCL kernel replay, protected merge or editorial admission.

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