ProbXiv
Explorersign in
Problem archiveProblem record

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?

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.