Skip to content

Erdős Problem #1093

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (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.

UNACCEPTED DRAFT — mathematical editorial review pending

This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.

Review the underlying draft on GitHub.

The question in plain language

A binomial coefficient \(\binom nk\) may have a small prime divisor. If it has no prime divisor at most \(k\), Erdős Problem #1093 assigns it a number called its deficiency.

For \(n\ge2k\), examine the \(k\) consecutive integers

\[ n,\ n-1,\ldots,n-k+1. \]

The deficiency is the number among them whose prime factors are all at most \(k\) (the \(k\)‑smooth terms). But if any prime at most \(k\) divides \(\binom nk\), the deficiency is undefined, not zero.

The open questions ask whether infinitely many such binomial coefficients have deficiency exactly one and whether only finitely many have deficiency greater than one.

A small example

Take \(\binom73=35=5\cdot7\). Neither prime factor is at most \(3\), so its deficiency is defined. Among \(7,6,5\), only \(6=2\cdot3\) is \(3\)‑smooth, giving deficiency one.

Other exact examples show larger deficiencies: \(\binom{47}{11}\) has deficiency four and \(\binom{284}{28}\) has deficiency nine. These are isolated arithmetic examples, not infinite families.

What is known

Erdős, Lacampagne and Selfridge introduced the problem in 1988. The maintained catalogue records their subsequent results, including a bound of the form \(n\ll2^k\sqrt{k}\) when the deficiency is defined and positive.

It lists examples with deficiencies one, two, three, four and nine. An affirmative result for eventual absence of higher deficiencies has been discussed conditionally on other strong conjectures; such a conditional argument does not settle the unconditional question.

GCL's current state

Authenticated source audit #2364 formalizes the undefined case and reproduces the deficiency values for all fourteen historical exceptional pairs associated with neighboring Problem #1094.

The program computes binomial coefficients as exact integers and tests smoothness by integer prime division. A finite search cannot prove either an infinite existence claim or a global finiteness claim.

What remains

Check the 1988 and 1993 original definitions and proofs, independently validate the smoothness arithmetic using prime valuations, and clarify the relationship between positive deficiency and counterexamples to the least-prime-factor conjecture #1094.

Sources and claim boundaries

Erdős Problem #1093; Erdős–Lacampagne–Selfridge (1988), p. 522; later 1993 estimates; GCL source return #2364. Both infinite/finiteness questions remain open. This article is unaccepted.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2364 — 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