Modular Arithmetichard
0:00.0

Which of the following statements about Fermat's Little Theorem are TRUE?

(I) If pp is prime and gcd(a,p)=1\gcd(a,p)=1, then ap11(modp)a^{p-1} \equiv 1 \pmod{p}

(II) For any prime pp and any integer aa, we have apa(modp)a^p \equiv a \pmod{p}

(III) If pp is an odd prime and gcd(a,p)=1\gcd(a,p)=1, then a(p1)/2±1(modp)a^{(p-1)/2} \equiv \pm 1 \pmod{p}