Let $k\geq2$ and $l\in\mathbb{N}$. Prove that $(k+1)^l > k^l$. As a part of another proof, I need to prove that $(k+1)^l > k^l$, for all $k$, with $k\geq2$ and $l\in\mathbb{N}$. I need some help starting the proof. Thank you.

Another way to see this is to take $l$th roots. Then all you want to prove is that $$k+1>k,$$ which is clearly true.
