MathNet 2010 — Part 02 Question 85

Consider positive integers that can be expressed in the form $\binom{n}{k}$ where $n \ge 4$ and $2 \le k \le n-2$. Prove that every such integer has at least two distinct prime divisors.