The question is as it is in the title:
Show that
$${{2m} \choose {m}} \leq \frac{2^{2m}}{\sqrt{2m}}$$
for all $m \in \mathbb{N}$.
I've had various attempts at this question but it never seems to lead anywhere fruitful. The hint we have been given is in the question is
Consider the square of the product
$$ \frac{(2m)!}{2^{2m}(m!)^2} = \frac{3 \times 5 \times 7 \times \dots \times (2m-1)}{2 \times 4 \times 6 \times \dots \times (2m)}. $$
From the hint it's not too hard to spot where one would go next – the LHS of the original question is disguised as some cheeky factorials – however induction keeps on failing for me and I'm struggling to see a more direct argument. Any light shed on this problem would be appreciated. I feel like I'm missing something obvious.
Thanks in advance.
Best Answer
Show the stronger inequality $${{2m} \choose {m}} <\frac{2^{2m}}{\sqrt{2m+1}}.$$ It is true for $m=1$. Induction step: for $m\geq 1$, $$\frac{(2m+2)!}{2^{2m+2}((m+1)!)^2}=\frac{(2m)!}{2^{2m}(m!)^2}\cdot \frac{2m+1}{2m+2}< \frac{1}{\sqrt{2m+1}}\cdot \frac{2m+1}{2m+2}\stackrel{?}{\leq}\frac{1}{\sqrt{2m+3}}.$$ So it remains to prove that $$4m^2+8m+3=(\sqrt{2m+1}\sqrt{2m+3})^2\leq (2m+2)^2=4m^2+8m+4$$ which holds.