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.
A short outline of the solution...
Note
To find last two digits , we always take m o d 1 0 0
Using the Euler's Theorem , which is , a ϕ ( n ) ≡ 1 m o d n . Applying it in the problem ...we have , ϕ ( 1 0 0 ) = 4 0 . So we arrive at a congruence which is 2 1 2 m o d 1 0 0 . If you are wondering how that 12 came to the power of base 2 ,
then note that 12 is the remainder when we divide 2012 by 40.
So the final congruence is , 4 0 9 6 m o d 1 0 0 and hence the last two digits are 96
Thanks to Euler , who made it all easy...
Upvote the solution of you like