I need to prove that $(\log n)^a$ will always be smaller than $n^b$ as $n$ get larger (to infinity), also the condition is $a, b > 0$ ($a,b$ are random). I test the graph and it's true but I cant' prove it. I can prove that $\log(n)$ always $< n$, $\log(\sqrt{n}) < \sqrt{n}$ but not the title.
Sorry, I type math on Word but when copying here it didn't work so I plain typing the math function.
Numerator:
$(\log n) ^a=(\log ((n^{b/a})^{a/b}))^a=$
$((a/b) \log n^{b/a})^a=$
$(a/b)^a (\log n^{b/a}) ^a$
Denominator:
$(n^{b/a})^a$
Putting together:
$(a/b)^a \left (\dfrac {\log n^{b/a}} {n^{b/a}} \right) ^a $
With $k:=(a/b)^a$ and $z:=n^{b/a}$ we have:
$k \left (\dfrac{\log z}{z} \right)^a. $
Take the limit $z \rightarrow \infty. $