Algebra.Com's Answer #515304 by Edwin McCravy(20056)  You can put this solution on YOUR website! if 3^(8n+3) divided by 5 what will be the remainder,where n is a integer \n" );
document.write( "\r\n" );
document.write( "If n=1, we have = = 177147, when divided by 5, has remainder 2.\r\n" );
document.write( "\r\n" );
document.write( "That is \r\n" );
document.write( "\r\n" );
document.write( "We will try to prove, by induction, that the remainder will always be 2.\r\n" );
document.write( "\r\n" );
document.write( "That is, we will try to prove for some integer p\r\n" );
document.write( "\r\n" );
document.write( "Assume that for all , \r\n" );
document.write( "\r\n" );
document.write( "(1) for some integer p <--assumed\r\n" );
document.write( "\r\n" );
document.write( "we want to use (1) to prove: \r\n" );
document.write( "\r\n" );
document.write( " for some integer q <--unproved \r\n" );
document.write( "\r\n" );
document.write( "or\r\n" );
document.write( "\r\n" );
document.write( " for some integer q <--unproved\r\n" );
document.write( "\r\n" );
document.write( "or\r\n" );
document.write( "\r\n" );
document.write( "(2) for some integer q <--unproved\r\n" );
document.write( "\r\n" );
document.write( "We want to show that the assumption of (1) imples (2)\r\n" );
document.write( "\r\n" );
document.write( "Multiply both sides of (1) by 3^8\r\n" );
document.write( "\r\n" );
document.write( " \r\n" );
document.write( "\r\n" );
document.write( " \r\n" );
document.write( "\r\n" );
document.write( " \r\n" );
document.write( "\r\n" );
document.write( " \r\n" );
document.write( "\r\n" );
document.write( " \r\n" );
document.write( "\r\n" );
document.write( "So we take integer and we have proved (2)\r\n" );
document.write( "\r\n" );
document.write( "(2) for some integer q\r\n" );
document.write( "\r\n" );
document.write( "Therefore the remainder is 2 for all n\r\n" );
document.write( "\r\n" );
document.write( "Edwin \n" );
document.write( " |