I have been trying to prove by induction that for all $n \ge 0, \frac{1}{n} \ge \frac{n!}{n^n} $
Here is my proof so far:
Prove that for $ n = 1, \frac{1}{n} \ge \frac{n!}{n^n} $
$ \frac{1}{1} = 1 $
$ \frac{1!}{1^1} = 1 \le 1 $
Next, assume there exists $ n \ge 0 $ such that $ \frac{n!}{n^n} \le \frac{1}{n}. $. We'll prove that $ \frac{1}{n+1} \ge $ $\frac{(n+1)!}{(n+1)^{n+1}} $.
$\frac{(n+1)!}{(n+1)^{n+1}} = \frac{(n!)(n+1)}{(n+1)^{n+1}} = \frac{n!}{(n+1)^n} \lt \frac{n!}{n^n} \le \frac{1}{n}$
However, I don't know how to show now that $\frac{n!}{(n+1)^n} \le \frac{1}{n +1}$
Looks like a trivial proof holds. $n!$ has $n$ terms, each $\le n$. So $\frac{n!}{n^n}=\frac{1}{n}\times C\le \frac{1}{n}$, since $C=\frac{2}{n}\times...\frac{n}{n}\le 1$.