document.write( "Question 1075272: Use mathematical induction to prove that the statement is true for every positive integer n. Show your work.\r
\n" );
document.write( "\n" );
document.write( "2 is a factor of n2 - n + 2\r
\n" );
document.write( "\n" );
document.write( "pls give step by step answer \n" );
document.write( "
Algebra.Com's Answer #689953 by stanbon(75887)![]() ![]() ![]() You can put this solution on YOUR website! Use mathematical induction to prove that the statement is true for every positive integer n. Show your work. \n" ); document.write( "2 is a factor of n2 - n + 2 \n" ); document.write( "pls give step by step answer \n" ); document.write( "----- \n" ); document.write( "1st:: Show it is true for n = 1:: \n" ); document.write( "1^2 - 1 + 2 = 2 \n" ); document.write( "true \n" ); document.write( "------------------- \n" ); document.write( "2nd:: Assume it is true for n = k:: \n" ); document.write( "2 is a factor of k^2-k+2 \n" ); document.write( "------- \n" ); document.write( "3rd:: Then prove is must be true for n = k+1 \n" ); document.write( "(k+1)^2 - (k+1) +2 = k^2 + 2k+1 -k-1+2 \n" ); document.write( "= [k^2 -k +2] + [2k+1-1] \n" ); document.write( "= [k^2-k+2]+[2k] \n" ); document.write( "Divisible be 2 because k^2-k+2 is divisible be 2 \n" ); document.write( "and 2k is divisible by 2. \n" ); document.write( "==== \n" ); document.write( "Cheers, \n" ); document.write( "Stan H. \n" ); document.write( "---------------- \n" ); document.write( " \n" ); document.write( " |