1 |
|
Find the remainder when the 100-digit integer above is divided by 7.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Follow this equation : 7 1 ( … a 7 a 6 a 5 a 4 a 3 a 2 a 1 a 0 ) = 7 1 ( 1 0 0 a 0 + 1 0 1 a 1 + 1 0 2 a 2 + 1 0 3 a 3 + 1 0 4 a 4 + 1 0 5 a 5 + 1 0 6 a 6 + 1 0 7 a 7 + … ) = 7 1 a 0 + ( 1 + 7 3 ) a 1 + ( 1 4 + 7 2 ) a 2 + ( 1 4 2 + 7 6 ) a 3 + ( 1 4 2 8 + 7 4 ) a 4 + ( 1 4 2 8 5 + 7 5 ) a 5 + ( 1 4 2 8 5 7 + 7 1 ) a 6 + ( 1 4 2 8 5 7 1 + 7 3 ) a 7 + … = 7 1 ( a 0 + a 6 + … ) + 7 3 ( a 1 + a 7 + … ) + 7 2 ( a 2 + a 8 + … ) + 7 6 ( a 3 + a 9 + … ) + 7 4 ( a 4 + a 1 0 + … ) + 7 5 ( a 5 + a 1 1 + … ) That's how the digit define the remainder. From that equation, we know that if [a 0 + a 6 + \ldots = a 3 + a 9 + \ldots\ = n] It will make those (0+6k) and (3+6k) number cannot control remainder. I don't know how to explain, but here i find the remainder : 739,289 mod 7 --> 5 0 0 , 0 5 0 --> 5(5/7) + 5(3/7) --> 5(8/7) --> 40/7 -- >5 + 5/7 ---another example--- 295,381,629,618,492,628 mod 7 --> 12 20 16 , 15 11 17 --> 0 9 0 , 3 0 1 --> 9(4/7) + 3(2/7) + 1(1/7) --> 36/7 + 6/7 + 1/7 --> 43/7 --> 6 + 1/7
That is manual way. You also can solve with calculator. If it asked 391,294,163,813,713,017,371,824,817 mod 7 Then in calculator, calculate 391,294,163 mod 7, then it will result 1. Then add the result in front of next number, calculate 1,813,713,017 mod 7, then it will result 4. Then add the result in front of next number, calculate 4,371,824,817 mod 7, then it will result 3, the remainder of 27 digit above divide 7.
That's what i can say. About the problem, there is some tricky number which make the problem easier as 4 digit ;)