TITLE: A simple proof that $\bigl(1+\frac1n\bigr)^n\leq3-\frac1n$?
QUESTION [12 upvotes]: The inequality
$$
e_n:=\left(1+\frac1n\right)^n\leq3-\frac1n,
$$
where $n\in\mathbb{N}_+$, is certainly true, because we know, how LHS is connected with $e$. The other argument is the standard proof of boundedness of $(e_n)$, which uses the binomial theorem.
Are there any more elementary proofs of this inequality?

REPLY [7 votes]: Since $f(t)=\frac{1}{t}$ is a convex function on $\mathbb{R}^+$, we have:
$$\log\left(1+\frac{1}{n}\right)=\int_{n}^{n+1}\frac{dt}{t}\leq\frac{1}{2}\left(\frac{1}{n}+\frac{1}{n+1}\right)\tag{1}$$
hence:
$$ \left(1+\frac{1}{n}\right)^n \leq \exp\left(1-\frac{1}{2n+2}\right)\leq\frac{e}{1+\frac{1}{2n+2}}=\frac{2n+2}{2n+3}e \tag{2}$$
that is stronger than $ \left(1+\frac{1}{n}\right)^n \leq 3-\frac{1}{n}$ for any $n\geq 2$.