Binomial Coefficient of Prime

Theorem
Let $p$ be a prime number.

Then:
 * $\displaystyle \forall k \in \Z: 0 < k < p: \binom p k \equiv 0 \pmod p$

where $\displaystyle \binom p k$ is defined as a binomial coefficient.