document.write( "Question 1038890: A number N when divided by 5 leaves remainder 1 and when divided by 6 leaves remainder 3. Find the remainder when N is divided by 30.\r
\n" );
document.write( "\n" );
document.write( "a) 19 b) 17 c) 15 d) 21\r
\n" );
document.write( "\n" );
document.write( " \n" );
document.write( "
Algebra.Com's Answer #653641 by rothauserc(4718)![]() ![]() You can put this solution on YOUR website! N is congruent to 1 modulo 5 \n" ); document.write( "N is congruent to 3 modulo 6 \n" ); document.write( ": \n" ); document.write( "N - 1 is divisible by 5 \n" ); document.write( "N - 3 is divisible by 6 \n" ); document.write( ": \n" ); document.write( "we can use the answers as remainders which are congruent to N \n" ); document.write( ": \n" ); document.write( "a) 19 \n" ); document.write( "19 -1 = 18 is not divisible by 5 \n" ); document.write( "b) 17 \n" ); document.write( "17 -1 = 16 is not divisible by 5 \n" ); document.write( "c) 15 \n" ); document.write( "15 -1 = 14 is not divisible by 5 \n" ); document.write( "d) 21 \n" ); document.write( "21 - 1 = 20 is divisible by 5 \n" ); document.write( "21 - 3 = 18 is divisible by 6 \n" ); document.write( "******************************** \n" ); document.write( "the answer is d, 21 since \n" ); document.write( "21 is congruent to 21 modulo 30 \n" ); document.write( "******************************** \n" ); document.write( ": \n" ); document.write( " |