Euler's Theorem

If integers $a$ and $n$ are Coprime, ($\text{GCD}(a,n)=1$) then: $a^{\varphi (n)}\equiv 1(modn)$

Find Last 2 Digits Example

https://www.youtube.com/watch?v=zRPtegac8Lw