<s>[INST] Prove by induction: $2!\cdot 4!\cdot 6!\cdot\cdot\cdot (2n)!\ge ((n+1)!)^n$ Prove by induction: $2!\cdot 4!\cdot 6!\cdot\cdot\cdot (2n)!\ge ((n+1)!)^n$
For $n=1$ inequality holds.
$(*)$For $n=k$
$2!\cdot\cdot\cdot (2k)!\ge ((k+1)!)^k$
Multiplying LHS and RHS with $(2k+2)!$ gives
$$2!\cdot\cdot\cdot (2k)!(2k+2)!\ge ((k+1)!)^k(2k+2)!$$
Assume (by contradiction)$$2!\cdot\cdot\cdot (2k)!(2k+2)!< ((k+1)!)^k(2k+2)!$$
$$2!\cdot\cdot\cdot (2k)!(2k+2)!-((k+1)!)^k(2k+2)!<0$$
$$(2k+2)!(2!\cdot\cdot\cdot (2k)!-((k+1)!)^k)<0$$
$(2!\cdot\cdot\cdot (2k)!-((k+1)!)^k)\ge 0$ by $(*)$, thus inequality holds $\forall n\in\mathbb{N}$
Is this proof correct?
 [/INST] That is equivalent to:
$$ \sum_{k=1}^{n} \log\Gamma(2k+1) \geq n \log\Gamma(n+2) \tag{1}$$
that is a trivial inequality, since $\log\Gamma$ is a convex function, due to the Bohr-Mollerup theorem, for instance.
</s>