Skip to content

Erdős Problem #683

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory, primes, 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

How large must the biggest prime factor of a binomial coefficient be? Erdős Problem #683 asks whether some fixed \(c>0\) guarantees \(P\!\left(\binom nk\right)\geq\min\{n-k+1,k^{1+c}\}\) for a suitable range of \(k\), where \(P(r)\) means the largest prime factor of \(r>1\). The maintained problem remains OPEN. There are two source-definition issues: the maintained text includes \(k=n\) (for which the coefficient is \(1\)), and the pinned formalization changes the non-strict inequality to a strict one.

A small example

Take \(n=8\) and \(k=7\). Since \(\binom87=8=2^3\), its largest prime factor is \(2\). For every \(c>0\), \(\min\{8-7+1,7^{1+c}\}=2\). Thus the maintained non-strict claim reads \(2\geq2\), correctly. But the pinned Lean theorem requires \(2>2\), which is FALSE. This is no isolated small accident: for every power of two \(n=2^a\geq4\), choosing \(k=n-1\) gives \(\binom n{n-1}=n\) and largest prime factor \(2\); the same false strict inequality recurs infinitely often.

What is known

The classical Sylvester–Schur theorem, cited by the maintained catalogue, states that for \(k\leq n/2\) the largest prime factor of \(\binom nk\) exceeds \(k\). Erdős later obtained a bound on the scale of \(k\log k\). Neither is the requested power \(k^{1+c}\) for an absolute \(c>0\). A proposed still-stronger exponential-in \(\sqrt k\) bound is heuristic, not proved. The symmetry \(\binom nk=\binom n{n-k}\) makes the upper-half range relevant. At \(k=n\), however, \(\binom nn=1\) has no prime factors under the usual mathematical definition. One must either restrict to \(k<n\) or explicitly define \(P(1)\); adopting \(P(1)=1\) makes the non-strict endpoint trivial, whereas the formal file's finite-set supremum convention gives \(P(1)=0\).

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 protected formal statement's strict > prime factor inequality differs from maintained >=; k=n needs a convention for P(1).

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

The bounded next action is a protected source-correction proposal: verify the historical non-strict inequality, decide whether to use \(k<n\) or a special \(P(1)\) convention, then change the formal theorem target and add an exact regression asserting the failure of the old strict target. After that one may investigate the correct still-open inequality. Critical mathematical/source review, protected publication, browser mathematical typesetting and separate V2 editorial admission remain outstanding.

Sources and claim boundaries

Maintained #683, GCL-pinned formal source, and authenticated exact counterexample report. Classical [Er34]/[Er55d] bounds cited but full original papers uninspected. This is an editorially reviewed with source exception draft: the formal target is false, the source conjecture remains open, and no newly certified theorem proof or editorial admission is claimed.

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: #1954 — 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.

Back to catalogue · Compendium introduction