Erdős Problem #1063 — Let k≥ 2 and define n_k≥ 2k to be the least value of n such that n-i divides binomnk for all but one 0≤ i<k.
Statement
Let and define to be the least value of such that divides for all but one . Estimate .
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.