Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Modular Arithmetichard
0:00.0

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

(I) If ppp is prime and gcd⁡(a,p)=1\gcd(a,p)=1gcd(a,p)=1, then ap−1≡1(modp)a^{p-1} \equiv 1 \pmod{p}ap−1≡1(modp)

(II) For any prime ppp and any integer aaa, we have ap≡a(modp)a^p \equiv a \pmod{p}ap≡a(modp)

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