I want to prove this statement:
$\alpha \geq1$ and $n\geq 2\alpha \log(2\alpha)$ then $n \geq \alpha \log(2n)$
It seemed pretty simple but I couldn't do too much. My first attempt was
$$ \log(n) \geq \log ( 2\alpha \log(2\alpha) ) $$
But this attempt didn't look promising. Could you give me a hint?
Assume, for the sake of contradiction, that there exists $(\alpha, n)$ such that $\alpha \ge 1$ and $n \ge 2\alpha \ln (2\alpha)$ and $n < \alpha \ln (2n)$.
We have $\alpha \ln(2n) > n \ge 2\alpha \ln(2\alpha)$ which results in $n \ge 2\alpha^2$. Thus, we have $n < \alpha \ln(2n) \le \sqrt{n/2}\ln(2n)$ which results in $\sqrt{2n} < \ln(2n)$, or $\mathrm{e}^{\sqrt{2n}} < 2n$. However, using $\mathrm{e}^x \ge 1 + x + \frac12 x^2 + \frac16 x^3$ for all $x > 0$, we have $$\mathrm{e}^{\sqrt{2n}} \ge 1 + \sqrt{2n} + \frac12 \sqrt{2n}^2 + \frac16 \sqrt{2n}^3 > 2n.$$ Contradiction.