Show that $\binom{2n}{n} < 2^{2n - 2}$ for all $n \geq 5$.
Can I get some help please? I started by trying to prove this by induction, For the base case $n=5$, I showed the inequality is true. For the the induction step, I assumed that the inequality is true and started trying to show it's true for $n+1$. So $\binom{2n+2}{n+1}$ and I broke it down by combinatorics to get $2\binom{2n}{n}+\binom{2n}{n+1}+\binom{2n}{n-1}$ which is less than $2\cdot 2^{2n-2}+\binom{2n}{n+1}+\binom{2n}{n-1}$ using the inductive step and I don't know how to continue.
Base Case: $n = 5$ can be checked manually.
Now, we need to show that $$\binom{2n + 2}{n + 1} < 2 ^ {2n}$$ assuming that $$\binom{2n}{n} < 2 ^ {2n - 2}$$
Note that it suffices to show that $$\frac{\binom{2n + 2}{n + 1}}{\binom{2n}{n}} < 4 \text{ (Why?)}$$
Expanding and cross-multiplying (all terms are positive), we get $$\frac{(2n + 1)(2n + 2)}{(n + 1)(n + 1)} < 4$$ $$\iff \frac{2n + 1}{n + 1} < 2$$ which is true.