Fermat's Little Theorem states that if p is a prime number and a is an integer not divisible by p, then a^(p1) is congruent to 1 modulo p. In other words, if we divide a^(p1) by p, the remainder will always be 1. This theorem is important in number theory and has applications in cryptography, including primality testing and publickey encryption.
#fermatstheorem
#fermatslittletheorem