Ononot — If \gcd(a, n) = 1, then by Euler's Totient Theorem, a^{\phi(

Guest Session: 1 Question Remaining. Create Account to save progress.

Modular Arithmeticmedium

0:00.0

If $\gcd(a, n) = 1$ , then by Euler's Totient Theorem, $a^{\phi(n)} \equiv ? \pmod{n}$ .