Question

Let a be 63, p be prime number

by Fermat theore, a^p=a(mod p)
Then what is (a+1)^p=?(mod p)

is it 64 btw what is fermat theorem?

Answer 1

Yes, it is 64 mod p

Fermat's Little Theorem a^p = a mod p (p prime, a any integer) OR

a^(p-1) = 1 mod p ( also with gcd (a,p) =1)