Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Problem 1093
Statement. For we define the deficiency of as follows. If is divisible by a prime then the deficiency is undefined. Otherwise, the deficiency is the number of such that is -smooth, that is, divisible only by primes .
Are there infinitely many binomial coefficients with deficiency ? Are there only finitely many with deficiency ?
Status. Open: the site's label (page last edited 27 December 2025). The site's commentary credits Kevin Barreto's thread post of 16 December 2025 with a conditional answer to the second question. The post assumes two conjectures. The first strengthens the Lagarias--Soundararajan conjecture: for some and every , only finitely many coprime have every prime factor of below . The second is a lower bound , with and all large , on the least at which has deficiency at least , when such an exists. From these the post proves that only finitely many with have deficiency at least . A conditional thread post, it has no claim page.
Source. erdosproblems.com/1093, accessed 2026-09-04. Cite as: T. F. Bloom, Erdős Problem #1093, https://www.erdosproblems.com/1093.
References.
- [ELS88] Erdős, P. and Lacampagne, C. B. and Selfridge, J. L., Prime factors of binomial coefficients and related problems. Acta Arith. (1988), 507-523.
- [ELS93] Erdős, P. and Lacampagne, C. B. and Selfridge, J. L., [[../library/factorials_binomials/erdos_1993_estimates_least_prime_factor_binomial_coefficient/_index|Estimates of the least prime factor of a binomial coefficient]]. Math. Comp. (1993), 215-224.
Formalization. Statement in formal-conjectures.
Progress
Not yet compiled.
Known Results
Not yet compiled.
Linked library material
These entries are derived from explicit links on library pages. They are navigation only and do not by themselves record mathematical progress.