1
$\begingroup$

If $p$ is a prime number greater than 2 and $k\in \mathbb{N}$ so that $k < p$, how can I prove that $p\choose k$ is congruent to $0 \bmod p$?

  • 1
    Note natural means $k \geq 1.$ This has probably been asked several times before, it's a standard and useful fact.2012-12-05

3 Answers 3