Fermat's Little Theorem states that if 'p' is a prime number and 'a' is an integer not divisible by 'p', then $$a^{p-1} \equiv 1 \ (mod \ p)$$. This theorem is a foundational concept in number theory and has implications for modular arithmetic, cryptography, and primality testing. It illustrates Fermat's significant contributions to understanding the properties of prime numbers and their relationships with other integers.
congrats on reading the definition of Fermat's Little Theorem. now let's actually learn it.