Binomial Coefficient of Prime

Theorem
Let $$p$$ be a prime number.

Then $$\forall k \in \mathbb{Z}: 0 < k < p: \binom p k \equiv 0 \left({\bmod\, p}\right)$$

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