document.write( "Question 1035666: For a proof by induction of the math statement below, identify the correct step for proving the theorem is true for n = k + 1.
\n" ); document.write( "1+3+5+...+(2n-1)=n^2
\n" ); document.write( "A: 1+3+5...+(2k-1)+(2(k+1)-1)=(k+1)^2
\n" ); document.write( "B: 1+3+5...+(2k-1)=(k+1)^2
\n" ); document.write( "C: 1+3+5...+(2k-1)=(k)^2
\n" ); document.write( "D: 1+3+5...+(2k-1)+k+1=(2k+1)^2 \n" ); document.write( "

Algebra.Com's Answer #650334 by stanbon(75887) $\"\"$ $\"About$

You can put this solution on YOUR website!
Answer: A
\n" ); document.write( "-----
\n" ); document.write( "Cheers,
\n" ); document.write( "Stan H.
\n" ); document.write( "------- \n" ); document.write( "

\n" );