I have to prove that $ 2^n = o(n!) $, that is, $ \forall c \gt 0 \quad \exists$ $ n_0 \in \mathbb N$ such that $ \forall n \ge n_0$ we have $ 2^n \lt c.n! $
Well, this is what I did so far:
First I proved, by induction in $n$, that $ 2^n \lt c.n! $ (considering $c = 1$ and $ n_0 = 4$).
Then I proved, by induction in $c$, that $ 2^n \lt c.n! $ (considering $c \gt 1$ and $ n_0 = 4$).
Now I got stuck trying to prove for $0 \lt c \lt 1$. (I tried to consider $c$ as $\frac1m $ and prove by induction for $m \gt 1$)
Anyone can help me?
Thanks in advance.
Sufficient to check $2^n/n!\rightarrow 0$ as $n\rightarrow\infty$. Observe that $\sum_{n=0}^\infty2^n/n!=e^2$, so the series $2^n/n!$ converges uniformly. Thats it.