Prove or disprove $n^{28} = O(2^n)$.
My solution: $$\lim _{n \to \infty} \dfrac {2^n} {n^{28}} = \dfrac {2*2*2 \dots _{(n \ times)}} {n * n * \dots _{(28 \ times)}}$$
As $n \to \infty$, both the numerator and the denominator approach $\infty$.
So am not sure whether $2^n = O(n^{28})$ or the other way around.
Apply l'Hopital's rule 28 times and we have
$$\lim_{n\to\infty} \frac{n^{28}}{2^n} = \lim_{n\to\infty} \frac{28!}{(\ln 2)^{28} 2^n} = 0$$
Thus there exists a constant $M$ such that for sufficiently large $n$, we have $$n^{28} \leq M 2^n$$
Choosing $M = 1$ will do. Hence by definition of the big O notation, $n^{28} = O(2^n)$.
It is however not true that $2^n = O(n^{28})$, as $\displaystyle \frac{2^n} {n^{28}}$ can be made arbitrarily large by choosing a sufficiently large $n$. That is, there is no constant $M$ such that for all sufficiently large $n$ we have
$$2^n \leq M n^{28}$$