Fermat's Little Theorem

Fermat's little theoremis a fundamental theorem in elementary number theory, which helps compute powers of integers moduloprime numbers. It is a special case of Euler's theorem, and is important in applications of elementary number theory, including primality testing and public-key cryptography. Let p be a prime number, and a be any integer. Then a^p^ - a is always divisible by p.