What does Fermat's Little Theorem state for prime p and integer a (where p does not divide a)?

Question

Accepted Answer

(B) a^(p-1) ≡ 1 (mod p). Explanation: Fermat's Little Theorem: a^(p-1) ≡ 1 (mod p) for prime p and gcd(a,p)=1.