N Choose k is not greater than n^k

Theorem

 * $\displaystyle {n \choose k} < n^k$

for all $n,k \in \N$, $0 < k \le n$; here $\displaystyle {n \choose k}$ is $n$ choose $k$.

Proof
As $k! \ge 1$, the hypothesis holds.