document.write( "Question 1137605: Prove the following using mathematical induction. Be sure to show the anchor as well as
\n" ); document.write( "the full induction steps. Please show all the parts to the
\n" ); document.write( "proof.
\n" ); document.write( "3+7+11+...+(4n-1)=n(2n+1)
\n" ); document.write( "

Algebra.Com's Answer #755484 by math_helper(2461)\"\" \"About 
You can put this solution on YOUR website!
Base case: n=1
\n" ); document.write( "LHS: 3
\n" ); document.write( "RHS: 1(2*1+1) = 1(3) = 3
\n" ); document.write( "

\n" ); document.write( "Hypothesis: 3+7+11+...+(4k-1) = k(2k+1)
\n" ); document.write( "
\r
\n" ); document.write( "\n" ); document.write( "Must show the above is true for n=k+1\r
\n" ); document.write( "\n" ); document.write( "3+7+11+...+(4k-1)+(4(k+1)-1) =
\n" ); document.write( "\"+green%283%2B7%2B11%29+\" \"+green%28matrix%281%2C3%2C%22%2B%22%2C%22...%22%2C%22%2B%22%29%29\" \"+green%28%284k-1%29%29+\" + (4(k+1)-1) \r
\n" ); document.write( "\n" ); document.write( "By hypothesis, the green terms are k(2k+1), so we write
\n" ); document.write( "= \"+k%282k%2B1%29+%2B+%284%28k%2B1%29-1%29+\"
\n" ); document.write( "= \"%282k%5E2+%2B+k%29+%2B+%284k%2B3%29+\"
\n" ); document.write( "= \"+2k%5E2+%2B+5k+%2B+3+\"
\n" ); document.write( "= \"+%28k%2B1%29%282k%2B3%29+\"
\n" ); document.write( "(n=k+1)
\n" ); document.write( "= \"+++n%282n%2B1%29+\" DONE
\n" ); document.write( "
\n" ); document.write( "
\n" );