I'm trying to proof/refute the following equation:
$$n^n = \Omega(n!)$$
Generally I would try to use Convergence Criteria and or l'Hôpital's rule to solve such a problem.
$$\lim_{n\to \inf}{{f(n)}\over{g(n)}} = K$$
However, in this case $n!$ is somewhat of a party-stopper. I found Stirling's approximation which states that:
$$n! \approx \left(\frac{n}{e}\right)^n\sqrt{2πn} $$
My idea was therefore:
$${n^n}\over{(\frac{n}{e})^n\sqrt{2πn}}$$ $${n^n}\over{\frac{n^n}{e^n}\sqrt{2πn}}$$ $${e^n}\over{\sqrt{2πn}}$$ $$\lim_{x\to \infty}{{e^2n}\over{2πn}} = \infty$$
$$ 0 < K \leq \infty $$
therefore the original equation is true.
Is that approach "ok", did I understand Stirling's approximation correctly?