What is the remainder when is divided by 100?
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.
We can take 7 7 0 0 (mod 4) and (mod 25), then we can use the Chinese Remainder Theorem to find 7 7 0 0 (mod 100).
7 7 0 0 ≡ ( − 1 ) 7 0 0 ≡ 1 (mod 8) 7 7 0 0 ≡ 4 9 3 5 0 ≡ ( − 1 ) 3 5 0 ≡ 1 (mod 25)
Using the Chinese remainder theorem, we get that 7 7 0 0 ≡ 1 (mod 100).