I encountered an exercise asking to prove the following inequality:
$4log_2(n) \leq n$ for all integers $n \geq 16$ strictly using induction.
I understand intuitively why the inequality holds and I've thought of alternative methods to prove it, but my challenge has been proving it with induction. It seems like I've tried all sorts of algebraic manipulations and tricks with logarithms, but nothing works.
Hint:
Clearly $4 \log_2 n = n$ for $n=16$.
Now compute $4 \log_2 (n+1)$ and subtract $4 \log_2 n$ (for $n\geq 16$) to see that this increment is less than $1$, which means that the right-hand side is always greater than the left-hand side... your goal.