Erdős Problem #384 — A small prime divisor of every nontrivial binomial coefficient

If $1<k<n-1$ , must $\binom{n}{k}$ have a prime divisor smaller than $n/2$ , with the sole exception $\binom{7}{3}=5·7$ ?

References

Primary source

P. Erdős and R. L. Graham, Old and new problems and results in combinatorial number theory, Monographies de L'Enseignement Mathématique 28 (1980).

Posted 1 month ago

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

No solutions have been posted yet.