I'm stuck in a prove by Mathematical Induction and I have no clue how to continue on.
To prove:
$2!\cdot 4! \cdot 6! \cdot ...\cdot(2n)! \geq [(n+1)!]^n$ for all $n \in \mathbb{N}$
Proof:
We proceed by induction. Since $2! = 2 \geq 2^1 =2$ is true for $n = 1$. Assume for a $k \in \mathbb{N}$, that
$2!\cdot 4! \cdot 6! \cdot ...\cdot(2k)! \geq [(k+1)!]^n$ .
We show that
$2!\cdot 4! \cdot 6! \cdot ...\cdot(2(k+1))! \geq [(k+2)!]^{k+1}$
Observe that
$2!\cdot 4! \cdot 6! \cdot ...\cdot (2k)! \cdot (2(k+1))! \geq [(k+1)!]^k (2k+2)!$
I do not, however, know how to proceed further.
We wish to show $2!4!\cdots (2k+2)! \geq [(k+2)!]^{k+1}$. By the inductive hypothesis
$$[(k+2)!]^{k+1}=[(k+1)!]^k\cdot (k+1)!(k+2)^{k+1}\leq 2!4!\dots(2k)!\cdot(k+1)!(k+2)^{k+1}.$$
So, the result holds if we can show that
$$(k+1)!(k+2)^{k+1}\leq (2k+2)!$$
However, we can estimate $(k+2)$ by $(k+n)$ for all $n\geq 2$:
$$(k+1)!(k+2)^{k+1}\leq(k+1)!(k+2)(k+3)\cdots (k+(k+2)) = (2k+2)!$$
and the result follows.