By using principle of mathematical induction prove 2^n > n^2 if n is an integer greater than 4.
The Answer to the Question
is below this banner.
Here's the Solution to this Question
Let be the proposition that
BASIS STEP: is true, because
INDUCTIVE STEP: For the inductive hypothesis we assume that holds for an arbitrary integer That is, we assume that
Under this assumption, it must be shown that is true, namely, that
We have that
This shows that is true under the assumption that is true. This completes the inductive step
We have completed the basis step and the inductive step, so by mathematical induction we know that is true for all integers
That is, we have proven that for all integers