I've been looking for a method to discover how to find the range of values of $n$ that follow the $2^{n} < n^{8}$ inequality, other than brute checking every number.
Context: The question arises from an exercise provided by the book 'An Introduction to Algorithms', where the question asked is the following one:
For which values of n is $8n^2$ smaller than $64 * log_{2}(n)$?
I've tried simplifying and proceeded to try using the Lambert W function, but couldn't manage to separate adequately the n from the rest of the equation. Thus, I've decided to ask in a general manner the ways you could achieve the result by minimizing the manual number checking.
How should I proceed to arrive to the $2 \leq n \leq 43$ conclusion?
Edit, clarification: it is known from the beginning that the result must be an interval.
Using algebra.
Take logarithms and consider the function $$f(n)=\log \left(n^8\right)-\log \left(2^n\right)=8\log(n)-n\log(2)$$ It is obvious that $f(1)<0$ and $f(2)>0$. Concerning the derivatives $$f'(n)=\frac{8}{n}-\log (2)\qquad \text{and} \qquad f''(n)=-\frac{8}{n^2} \quad <0 \quad \forall n$$ The first derivative cancels at $n_*=\frac 8{\log (2)}$ and this corresponds to a maximum (second derivative test).
Now the only real solution of $f(n)=0$ for $n>1$ is given in terms of Lambert function $$f(n)=0 \implies n=-\frac{8 }{\log (2)}W_{-1}\left(-\frac{\log (2)}{8}\right)=43.56\cdots$$