Skip the trivial case and assume true for
Show is true:
Therefore, it is true for
use mathematical induction to prove the formula for every positive integer n.
3 + 5 + 7 + ... + (2n +1)= n(n +2)
this is a beastly problem.
i have proven that
n=1 so 2(1)+1=1(1)+2
3=3 so this works but now im dont know what to do next. i know im suppose to go further but im so lost. please help me understand this.
And you'd do that by saying:
and working from there.
Because you have *assumed* that it's true for n, you can directly substitute the term for the series up to .
And having *assumed* that it's true for n, (that bit's called the "induction hypothesis"), you will have *proved* that it still holds for n+1 (that bit's called the "induction step" and it's usually the one where the algebra happens).
So once you've shown it true for the base case, and by assuming the truth of the induction hypothesis for n you've shown it still holds for n+1, "the result follows by the Principle of Mathematical Induction".