Let p be a composite, and let us apply the simple rule stated by Lucas' theorem to check whether p is prime (that is, involving the p base representation). Now, assume that the result is positive; would that mean that indeed p divides $n \choose k$, or the result is random, since the hypothesis of p being a prime is violated?
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
Here's how it works:
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top