I stand that $\log n=O(n^{\epsilon})$ for any $\epsilon >0$.
At a previous example we have shown that $$e^{n^{\epsilon}} \geq \frac{n^{\epsilon d}}{d!}$$ where $d=\lfloor \frac{1}{\epsilon}\rfloor+1>\frac{1}{\epsilon}$, so $\epsilon d>1$ and we have $$e^{n^{\epsilon}} \geq \frac{n^{\epsilon d}}{d!} \geq n$$ for $n \geq n_0=\lfloor (d!)^{(1/(ed-1)}\rfloor$.
Taking logarithms we get the result.
Could you explain to me why the following stands??
$$e^{n^{\epsilon}} \geq \frac{n^{\epsilon d}}{d!} \geq n$$ for $n \geq n_0=\lfloor (d!)^{(1/(ed-1)}\rfloor$
Not answering the question. A total different approach can be this one:
$$\log x=\int_1^x \frac{dt}{t} \le \int_1^x \frac{dt}{t^\alpha}$$ for $\alpha < 1$. Hence: $$\log x \le \frac{1}{1-\alpha}x^{1-\alpha}$$ and $1-\alpha$ is any positive real here.