I need to prove the statement:
$$\forall x \ge 1, \quad \log_{2}(x!) - \frac{1}{2}x\log_2(x) \geq 0$$
I tried with a proof by induction (if there is an easier way, let me know!), so I tested the basis case $x = 1$, which holds, and by induction hypothesis, assumed that $\log_{2}(x!) - \frac{1}{2}x\log_2(x) \geq 0$ holds. Now I want to come to the conclusion that $$\log_{2}((x+1)!) - \frac{1}{2}(x+1)\log_2(x+1) \geq 0$$
After some manipulations, I find that $$\log_{2}((x+1)!) - \frac{1}{2}(x+1)\log_2(x+1) = \log_{2}(x!) - \frac{1}{2}\left[x\log_2(x+1)-\log_2(x+1)\right]$$ So if $$x\log_2(x+1)-\log_2(x+1) \leq x\log_2(x)$$ then $$\log_{2}((x+1)!) - \frac{1}{2}(x+1)\log_2(x+1) \geq 0$$
Again, after some manipulations, I come to this inequality $(x+1)^{(x-1)} \leq x^x$. I know it is true, but I can't figure out how to prove it.
Substitute $x \to x + 1$. Then, $(x+2)^{x} \leq (x+1)^{x}\cdot (x+1)\implies (1+\frac{1}{x+1})^{x} \leq x + 1$. This can be proven by induction.
The $x=1$ case is trivial, as $\frac{3}{2}\leq 2$.
Assume $(1+\frac{1}{k+1})^k \leq k+1$ is true. Then
$(1+\frac{1}{k+2})^{k+1} < (1+\frac{1}{k+1})^{k+1}\leq(k+1)(1+\frac{1}{k+1})=k+1+1=k+2$
Therefore by mathematical induction, the statement $(x+1)^{x-1}\leq x^x$ is true.