Question
Prove that $\frac{(2\text{n})!}{2^{2\text{n}}(\text{n}!)^2}\leq\frac{1}{\sqrt{3\text{n}+1}}$ for all $\text{n}\in\text{N}.$
Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.
$1.2+2.3+3.4+\ldots+n(n+1)=\frac{n}{3}(n+1)(n+2)$