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 essential in number theory as it helps establish properties of prime numbers and modular arithmetic, forming a foundation for concepts like primality testing and cryptography.
congrats on reading the definition of Fermat's Little Theorem. now let's actually learn it.