Prove by mathematical induction. 1 + 5 + 9 +...+ (4n-3) = (2n+1)(n-1) for n ≥ 2
The Answer to the Question
is below this banner.
Here's the Solution to this Question
Let be the proposition that
is true, because
For the inductive hypothesis we assume that holds for an arbitrary positive integer That is, we assume that
Under this assumption, it must be shown that is true, namely, that
is also true.
When we add to both sides of the equation in we obtain
This last equation 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 positive integers n. That is, we have proven that