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.
I'm pretty sure there's a simpler way, but here's how I did it (using the multiplication property of congruences). 9 2 = 8 1 (mod 1 0 0 ), 9 3 = 2 9 (mod 1 0 0 ), 9 4 = 6 1 (mod 1 0 0 ), 9 8 = 2 1 (mod 1 0 0 ), 9 9 = 8 9 (mod 1 0 0 ), and 9 1 0 = 1 (mod 1 0 0 ). Since the exponent 9 9 can be written as 1 0 0 n + 8 9 for some int. n , 9 9 9 = 9 1 0 0 n + 8 9 = ( 9 1 0 ) 1 0 n 9 8 9 = ( 1 ) 1 0 n ( 9 1 0 ) 8 9 9 = ( 1 ) ( 1 ) 8 ( 8 9 ) = 8 9 (mod 100).