If and are integers such and are divisible by 2002. Calculate the remainder of when divided by 2002.
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.
Lazy solution
Obviously, ( a , b ) = ( 0 , 0 ) is a solution. If this problem has a unique answer, as suggested, then it is 0 2 + 0 2 = 0 ≡ 0 mod 2 0 0 2 .
Oh, you say, I need to prove it's the only correct answer? Ah.
Complete solution
Let a + 5 b = M and 5 a − b = N . Then a = 2 6 M + 5 N , b = 2 6 5 M − N . When substituting this into a 2 + b 2 , then cross-terms with M N cancel, and we are left with a 2 + b 2 = 2 6 2 2 6 M 2 + 2 6 N 2 = 2 6 M 2 + N 2 . Since M and N are multiples of 2002, the numerator is a multiple of 2 0 0 2 2 = 2 0 0 2 ⋅ 7 7 ⋅ 2 6 ; after division by 26, the result is divisible by 2 0 0 2 ⋅ 7 7 , so that division by 2002 will give remainder 0 .