SOLUTION: How can I prove that for each positive integer n, the sum of the first n odd positive integers is n^2 using induction?
Algebra ->
Proofs
-> SOLUTION: How can I prove that for each positive integer n, the sum of the first n odd positive integers is n^2 using induction?
Log On
Question 856463: How can I prove that for each positive integer n, the sum of the first n odd positive integers is n^2 using induction? Answer by tommyt3rd(5050) (Show Source):
You can put this solution on YOUR website! step1 check (so true for first case)
step2 check that implies
in this case...
true so we are done (it must be true for all n)
