Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Problem 1093

../


Statement. For n≥2kn\geq 2k we define the deficiency of (nk)\binom{n}{k} as follows. If (nk)\binom{n}{k} is divisible by a prime p≤kp\leq k then the deficiency is undefined. Otherwise, the deficiency is the number of 0≤i<k0\leq i<k such that n−in-i is kk-smooth, that is, divisible only by primes ≤k\leq k.

Are there infinitely many binomial coefficients with deficiency 11? Are there only finitely many with deficiency >1>1?

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 xyzfinxyz_{\mathrm{fin}} conjecture: for some κ0>1\kappa_0>1 and every ϵ>0\epsilon>0, only finitely many coprime X+Y=ZX+Y=Z have every prime factor of XYZXYZ below (log⁡max⁡(∣X∣,∣Y∣,∣Z∣))κ0−ϵ(\log\max(|X|,|Y|,|Z|))^{\kappa_0-\epsilon}. The second is a lower bound log⁡n≥ckα\log n\ge ck^{\alpha}, with α>1/κ0\alpha>1/\kappa_0 and all large kk, on the least n≥2kn\ge2k at which (nk)\binom nk has deficiency at least 22, when such an nn exists. From these the post proves that only finitely many (nk)\binom nk with n≥2kn\ge2k have deficiency at least 22. 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.