Congruence and Modular Arithmetic

FLT actually follows from the more general

Fermat’s Little Theorem (FT)

For all prime numbers and integers not divisible by , we have

Corollary for Fermat’s Little Theorem

“Fermat’s Little Theorem gives if gcd(a, p)=1, where p is a prime. Therefore, we can calculate the modular inverse of a as a^(p-2), by fast exponentiation also.”