Question

The Fermat’s little theorem for odd prime p and coprime number a is?

(a) a^p-1 ≡ 1 (mod p)

(b) a^p-1 ≡ 7 (mod p)

(c) a^p(2)-1 ≡ 1 (mod p)

(d) none of the mentioned

I got this question by my college director while I was bunking the class.

The query is from Number Theory topic in chapter Number Theory and Cryptography of Discrete Mathematics

Answer 1

Correct choice is (a) a^p-1 ≡ 1 (mod p)

The best I can explain: According to Fermat’s little theorem a^p-1 ≡ 1 (mod p).