Erdős Problem #1093 — For n≥ 2k we define the deficiency of binomnk as follows.
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 ?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.