What is the remainder when is divided by ?
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.
Okay, this has got to be the wierdest, most unexpected answer, 6 6 6
We make use of the property
a b mod c = ( a mod c ) b mod c
so that we find the modulo for successive exponentiation, as follows
a ( b − 1 ) b mod c = ( a ( b − 1 ) mod c ) b mod c
until b = 2 0 1 8
This is best done with a short computer program