The minimum positive integer p such that 3^p modulo 17 = 1 is
a. 5
b. 8
c. 12
d. 16
I got the answer as 16 by applying Fermat's Little theorem. But does this theorem makes sure that is the min. value?I mean is it possible to have number less than 16 which can satisfy the above equation?How can i prove that whether or not this is the smallest p satisfying the equation?
Fermat's little theorem only gives that there is a number that works for all of them and that number is at most $16$.
– user357980 Jun 19 '17 at 23:26