We are given the following succession:
[tex]1+3+5+\cdots+(2n-1)=n^2[/tex]To prove this by mathematical induction we need first to determine if the statement is true for n = 1. Replacing we get:
[tex]\begin{gathered} 1=1^2 \\ 1=1 \end{gathered}[/tex]Therefore, the statement is true for n = 1. Now we will assume that the statement is true and see if it holds for n + 1
Replacing n + 1:
[tex]undefined[/tex]