document.write( "Question 1035810: 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( "3^2+6^2+9^2+...\r
\n" );
document.write( "\n" );
document.write( " \n" );
document.write( "
Algebra.Com's Answer #650444 by JoelSchwartz(130) ![]() You can put this solution on YOUR website! The formula for this sequence 3^2+6^2+9^2+... is (3n)^2 when n starts at one. \n" ); document.write( "When I substitute k+1 for n i get (3(k+1))^2 or (3k+3)^2 when k starts at zero for the first number of the sequence. \n" ); document.write( " \n" ); document.write( " |