One-Line Proof for $n! \geq (\frac n e)^n$

combinatorics inequality factorial

Solution 1:

$$e^x = \sum_{k=0}^\infty \frac{x^k}{k!}$$

Set $x = n$ and look at the term for $k = n$.

Related

Help with combinatorial proof of identity: $\sum_{k=1}^{n} \frac{(-1)^{k+1}}{k} \binom{n}{k} = \sum_{k=1}^{n} \frac{1}{k}$
A definite integral with tanh and sin
$e^{i\theta}$ $=$ $\cos \theta + i \sin \theta$, a definition or theorem?
Dimension of R over Q without cardinality argument. [duplicate]
A set $A \subseteq \mathbb{R}$ is closed if and only if every convergent sequence in $\mathbb{R}$ completely contained in $A$ has its limit in $A$
Why is the outer measure of the set of irrational numbers in the interval [0,1] equal to 1?
Possible flaw in "proof" that a sum of two compact operators is compact
Distribution of sine of uniform random variable on $[0, 2\pi]$
$\sin 4x +\sqrt{3} \sin 3 x + \sin 2 x=0$
How do I prove that $3^n - 3$ is never a square number?
Computing $\lim_{n \to \infty} \sqrt[n]{ \int_{0}^{1} (1+x^n)^n dx}$
Problems with limit of factorials: $\;\lim_{n\to\infty}\frac{1!+2!+\ldots+n!}{n!}\;$