Euler's Totient Theorem Problem 2 Solution
Revision as of 19:17, 23 April 2021 by Borealbear (talk | contribs)
Problem
(BorealBear) Find the last two digits of 
.
Solution
This problem is just asking for 
. We can start by expanding the uppermost exponent, which gives us 
. Then, since 
, the exponent will be equal to 
. We can see that 
, so the expression simplifies to 
.
We're now left with finding the last two digits of 
. To do this, we use Chinese Remainder Theorem. We find that it is 
mod 
and 
mod 
From here, we use guess+check to get 
. -BorealBear
