document.write( "Question 941989: Use mathematical induction to prove that:
\n" );
document.write( "n
\n" );
document.write( "∑ r^2/{(2r-1)(2r+1)}= n(n+1)/(2(2n+1))
\n" );
document.write( "r=1\r
\n" );
document.write( "\n" );
document.write( "Thanks!! \n" );
document.write( "
Algebra.Com's Answer #576391 by Edwin McCravy(20056)![]() ![]() You can put this solution on YOUR website! We first want to prove that \n" ); document.write( "if equation (1) were true for some value of n,\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "(1) \n" ); document.write( "we want to show that if (1) holds for some value of n, then we \n" ); document.write( "can erase the ??? below and replace it with an equal sign:\r \n" ); document.write( "\n" ); document.write( " \n" ); document.write( "\n" ); document.write( "which simplifies to:\r \n" ); document.write( "\n" ); document.write( "(2) \n" ); document.write( "\n" ); document.write( "-----------------------\r \n" ); document.write( "\n" ); document.write( "So we add the (n+1)st term to both sides of (1)\r \n" ); document.write( "\n" ); document.write( " \n" ); document.write( "\n" ); document.write( "and simplify. The left side is just the sum to n+1 terms instead of n \n" ); document.write( "terms:\r \n" ); document.write( "\n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Get an LCD by multiplying the first fraction on the right by \n" ); document.write( "\n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Combine numerators over the LCD\r \n" ); document.write( "\n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Factor out (n+1) on top\r \n" ); document.write( "\n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Now cancel the (2n+1)'s\r \n" ); document.write( "\n" ); document.write( " \n" ); document.write( "\n" ); document.write( "That is the same as (2)\r \n" ); document.write( "\n" ); document.write( "All that's left is to show that (1) is true for n=1\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( "\n" ); document.write( "So since it works for n=1, it works for n=2. Then \n" ); document.write( "since it works for n=2, it works for n=3, then for n=4 \n" ); document.write( "and so on forever for all values on n.\r \n" ); document.write( "\n" ); document.write( "Edwin \n" ); document.write( " |