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.
Since k>=2, this will always hold true.
The actual proof, of course, would go the other way:
Since , . Now multiply on both sides by the positive number .
View Tag Cloud