document.write( "Question 1188706: Prove by induction and through divisibility algorithm that 11^n - 6 is divisible by 5 for every positive integer n. \n" ); document.write( "
Algebra.Com's Answer #819855 by ikleyn(52790)![]() ![]() You can put this solution on YOUR website! . \n" ); document.write( "Prove by induction and through divisibility algorithm that 11^n - 6 is divisible by 5 for every positive integer n. \n" ); document.write( "~~~~~~~~~~~~~~~~~\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \r\n" ); document.write( "(1) Base case n= 1.\r\n" ); document.write( "\r\n" ); document.write( " Then\r \n" ); document.write( "\n" ); document.write( "Solved.\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "/////////////\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Above was the proof by induction.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Below is more simple proof using the divisibility by 5 rule.\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \r\n" ); document.write( "The number\r \n" ); document.write( "\n" ); document.write( "Solved (twice, by two different methods).\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " |