document.write( "Question 111888:
\n" ); document.write( "Could you please help me with this problem. Thanks in advance.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "What is the remainder when 3 to the power 777777 is divided by 7.\r
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "

Algebra.Com's Answer #81640 by solver91311(24713)\"\" \"About 
You can put this solution on YOUR website!
If you raise 3 to successive powers starting with 1, and then perform integer division on the result by 7, you get a repeating pattern of remainders that repeats every 6th time.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Use the modulo function which returns the remainder for an integer division:
\n" ); document.write( "
\n" ); document.write( "\"3mod7=+++++++3\"
\n" ); document.write( "\"9mod7=%092\"
\n" ); document.write( "\"27mod7=%096\"
\n" ); document.write( "\"81mod7=%094\"
\n" ); document.write( "\"243mod7=%095\"
\n" ); document.write( "\"729mod7=%091\"
\n" ); document.write( "\"2187mod7=%093\"
\n" ); document.write( "\"6561mod7=%092\"
\n" ); document.write( "\"19683mod7=%096\"
\n" ); document.write( "\"59049mod7=%094\"
\n" ); document.write( "\"177147mod7=%095\"
\n" ); document.write( "\"16777216mod7=1\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Now, 777777 mod 6 is 3 (mod 6 because it repeats every sixth time), so \"3%5E%28777777%29+mod+7\" should yield the third item in the pattern, namely 6\r
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "
\n" );