Ononot — Using Fermat's little theorem: if p is prime and \gcd(a,p)=1

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

Number Systemshard

0:00.0

Using Fermat's little theorem: if $p$ is prime and $\gcd(a,p)=1$ , then $a^{p-1} \equiv \;?\pmod{p}$ .