Hey all, some help with the following proof would be appreciated: For all integers k >= 2, k^2 < k^3 I believe induction can be used here. Thanks a bunch!
Follow Math Help Forum on Facebook and Google+
divide by k^2 on both sides. 1<k. Since k>=2, this will always hold true.
The actual proof, of course, would go the other way: Since $\displaystyle k\ge 2$, $\displaystyle k> 1$. Now multiply on both sides by the positive number $\displaystyle k^2$.
View Tag Cloud