Applications in Modular Arithmetic

Fermat's Little Theorem is used to compute the modular inverse of a prime number and to speed up exponentiation. It is a fundamental building block in cryptography and competitive algorithms