Originally Posted by
epsilon Hello, I have a test tomorrow and this may or may not be on that test.
Anyway, I can't for the life of me understand what is being asked here:
Use Fermat's little theorem to compute:
3^302 mod 5, 3^302 mod 7, 3^302 mod 11
I've tried to look this up online, but I can't find anything. I just don't understand the connection to Fermat's little theorem, which is :
for p prime and a a pos. integer:
a^(p-1) CONGRUENT 1 (mod p)
Any help would be very appreciated!!
Thanks so much!