Prove the sum of odd numbers by induction

ProofMathematical induction

Prove that for every integer $n \ge 1$ ,

1 + 3 + 5 + \cdots + (2n - 1) = n^2.

Write your proof in plain text. Put math between dollar signs, like $x^2 \ge 0$ .

Your formatted proof appears here.

Prove the sum of odd numbers by induction · Proofwise

ProofMathematical induction

Prove that for every integer $n \ge 1$ ,

1 + 3 + 5 + \cdots + (2n - 1) = n^2.

Write your proof in plain text. Put math between dollar signs, like $x^2 \ge 0$ .

Your formatted proof appears here.