I want to prove $n^{\ln(n)} < n!$ for $n$ big enough, but right now all my attempts failed...
I tried mathematical induction, but that's not working, I get stuck at showing: $$(n + 1) \cdot n^{\ln(n)} \geq (n+1)^{\ln(n+1)}$$
I thought about trying to show $\ln(n)^2 < \ln(n!) = \sum_{k=1}^n\ln(n)$ but that also got me nowhere...
Any hint would be appreciated!