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) ≡ 1 (mod p). This theorem is fundamental in number theory and has applications in fields such as cryptography, particularly in algorithms like RSA encryption.