I have to determine which number is greater, $2\sqrt{2}$ or $e$.
I had a similar question as well, it was $2^\sqrt{2}$ compared to $e$.
For that one I managed to prove the inequality by using the increasing sequence converging to $e$: $(1+\frac1n )^n $
So I just searched for a value to assign to n such that $(1+\frac1n )^n \gt 2^\sqrt2$
I tried to proceed in a similar way with $2\sqrt{2} \gt \lt e$ , but it seems I can't get nowhere (I used the sequence decreasing and converging to $e$: $(1+\frac1n )^{n+1}$ )
Is there another way to prove the inequality without the use of the calculator and maybe using derivatives? The question was in a derivatives file, so I'm wondering is there's a way to get to the end using them.
Any hint would be much appreciated, thanks.
It is easy to show (by induction) that
$${2^n\over n!}\lt{1\over2^{n-4}}$$
for all $n\ge0$. It follows that
$$\begin{align} e^2&=1+2+{2^2\over2!}+{2^3\over3!}+{2^4\over4!}+{2^5\over5!}+\cdots\\ &=1+2+2+{4\over3}+{2\over3}+\left({2^5\over5!}+{2^6\over6!}+\cdots \right)\\ &=7+\left({2^5\over5!}+{2^6\over6!}+\cdots \right)\\ &\lt7+\left({1\over2}+{1\over4}+{1\over8}+\cdots\right)\\ &=7+1\\ &=8 \end{align}$$
so $e\lt\sqrt8=2\sqrt2$.
Remark: The induction proof for $2^n/n!\lt1/2^{n-4}$, best rewritten as $4^n\lt16n!$, requires verifying the first few "base" cases; the induction itself kicks in when $4\le n+1$:
$$4^n\lt16n!\implies4^{n+1}=4\cdot4^n\lt4\cdot16n!\le(n+1)16n!=16(n+1)!$$