Prove by induction for
$$ \frac{\left(1\right)\left(3\right)\left(5\right)...\left(2n-1\right)}{\left(2\right)\left(4\right)\left(6\right)...\left(2n\right)}\le\frac{1}{\sqrt{n+1}}\quad \text{for all integers}\quad n \ge 1$$
My current inductive step: $$ \frac{(2(k+1))!}{2^{2\left(k+1\right)}((k+1)!)^2} = \frac{2k+1}{2(k+1)} \cdot\frac{(2k)!}{2^{2k}\left(k!\right)^2}$$
I'm not sure how to proceed to show $$ \frac{2k+1}{2(k+1)} \cdot \frac{(2k)!}{2^{2k}\left(k!\right)^2} \le \frac{1}{\sqrt{k+2}}$$