MathNet 2011 Question 2

Prove that if $n$ and $k$ are positive integers such that $1 \lt k \lt n-1$, then the binomial coefficient $\binom{n}{k}$ is divisible by at least two different primes.