A question about inequality ${(n+1)\over e^n}^nHow to prove the inequality $${(n+1)\over e^n}^n<n!$$
I have tried mathematical induction, but it doesn't work! Are there other methods to solve it?
 A: Use the binomial theorem on $(1 + n)^n$ and try.
$$(1 + n)^n = 1 + \frac{n!}{1!(n - 1)!} n + \frac{n!}{2!(n - 2)!} n^2 + \frac{n!}{3!(n - 3)!} n^3 + \dots + \frac{n!}{n!(n - n)!} n^n \\ = n! \{\frac{1}{0! n!} + \frac{n}{1! (n-1)!} + \frac{n^2}{2! (n-2)!} + \frac{n^3}{3! (n-3)!} + \dots + \frac{n^n}{n! (n-n)!}\} \\ \le n! \{1 + \frac{n}{1!} + \frac{n^2}{2!} + \frac{n^3}{3!} + \dots\} \\ = n! e^n$$
Hope it is clear now.
A: Let
$$
a_n=\frac{(n+1)^n}{n!}
$$
then
$$
\begin{align}
a_n
&=\left(1+\frac1n\right)^n\frac{n^n}{n!}\\
&=\left(1+\frac1n\right)^n\frac{n^{n-1}}{(n-1)!}\\
&=\left(1+\frac1n\right)^n\,a_{n-1}\\[9pt]
&\le ea_{n-1}
\end{align}
$$
Since $a_1=2\lt e$, inductively, we have that $a_n\lt e^n$.
A: To prove that inequality, it means that we need to prove $${(n+1)^n\over n!}<e^n$$
Because${(1+{1\over n})^n}<e$, so ${(n+1)^n\over n!}$=${(1+{1\over n})^n}$${(1+{1\over n-1})^{n-1}}$``````$2^1\over1$$1\over1!$$<e^n$
A: Stirling approximation write $$n! \simeq \sqrt{2 \pi } e^{-n} n^{n+\frac{1}{2}}$$ Then the inequality is satisfied if $$n+1 \lt (2 \pi )^{\frac{1}{2 n}} n^{\frac{1}{2 n}+1} \simeq (2 \pi )^{\frac{1}{2 n}}[n+\frac{1}{2} \log \left(n\right)]$$ which is satisfied for any $n \geq 1$
