Fermat's little theorem

Fermat's little theorem is a fundamental result in number theory attributed to Pierre de Fermat that relates integers to primes in modular arithmetic. It asserts a congruence condition for powers of integers modulo a prime and underlies many developments in cryptography, algebraic number theory, and computational mathematics. The theorem connects to a long chain of work by figures such as Leonhard Euler, Carl Friedrich Gauss, Adrien-Marie Legendre, and institutions like the Royal Society and the Académie des Sciences where early number-theoretic results circulated.

Statement

Let p be a prime and a an integer not divisible by p; then a^(p−1) ≡ 1 (mod p) in the ring of integers modulo p. Equivalently, for any integer a, a^p ≡ a (mod p). The assertion appears in correspondence from Pierre de Fermat to Marin Mersenne and influenced later expositions by Leonhard Euler in his work on congruences and by Carl Friedrich Gauss in the foundational text Disquisitiones Arithmeticae. Related primes studied historically include the Mersenne primes, Sophie Germain primes, and primes considered by Évariste Galois and Niels Henrik Abel.

Proofs

Elementary proofs use group-theoretic or combinatorial arguments. A common approach views the multiplicative group of nonzero residues modulo p as a cyclic group of order p−1; this perspective is developed in texts by Emil Artin, David Hilbert, and Emmy Noether and builds on results from Augustin-Louis Cauchy and Jean-Pierre Serre. Another classical proof uses binomial coefficients and properties of the binomial theorem that were investigated by Isaac Newton and formalized by Brook Taylor; this combinatorial route draws on divisibility results noted by Joseph-Louis Lagrange and Adrien-Marie Legendre. Euler provided a generalization now known as Euler's theorem; Euler's argument is algebraic and anticipates notions in the group theory work of Arthur Cayley and William Rowan Hamilton. Modern expositions sometimes derive the result from the structure theorem for finite abelian groups as presented by Herbrand and Emmy Noether, or from ring-theoretic properties studied by Richard Dedekind and André Weil.

Consequences and corollaries

The theorem implies that for prime p the map x → x^p is a ring endomorphism of the finite field with p elements, a fact central to the theory of finite fields developed by Évariste Galois and expanded by Stefan Banach and Emil Artin. It provides a criterion for compositeness used in tests influenced by Fermat's correspondence, later refined by Carl Pomerance, Gary Miller, and Michael Rabin in probabilistic primality testing. Connections exist to the Wilson's theorem explored by John Wilson and published by Joseph-Louis Lagrange, and to multiplicative orders and cyclicity studied by Leopold Kronecker and Ferdinand Frobenius. The result underpins properties of primitive roots investigated by Adrien-Marie Legendre and given prominence by David Hilbert and Hermann Minkowski.

Applications

Fermat's little theorem is applied in deterministic and probabilistic primality tests such as variants of the Fermat primality test adapted by Gary Miller and Michael Rabin, and in modular exponentiation algorithms used in RSA (cryptosystem) implementations influenced by Ronald Rivest, Adi Shamir, and Leonard Adleman. It enables modular inversion techniques in computational systems developed at institutions like Bell Labs and used in standards from National Institute of Standards and Technology and implementations by firms such as IBM and Microsoft. The theorem also appears in coding theory contexts linked to Richard Hamming and Claude Shannon, and in algorithmic number theory developed by researchers at Massachusetts Institute of Technology and École Normale Supérieure.

Generalizations and related results

Generalizations include Euler's theorem (a^φ(n) ≡ 1 (mod n) when gcd(a,n)=1), the Carmichael function λ(n) giving sharper exponents, and results on pseudoprimes studied by Alford, Granville, and Pomerance. The Frobenius endomorphism in algebraic geometry echoes the theorem in the work of Ferdinand Frobenius and Alexander Grothendieck, while the structure of finite fields and Galois fields stems from Évariste Galois's theories. Deeper links extend to Lagrange's theorem in group theory, multiplicative order theorems associated with Émile Borel and Galois cohomology treatments advanced by Jean-Pierre Serre and Alexander Grothendieck. Results on primality certificates connect to work by Manindra Agrawal, Neeraj Kayal, and Nitin Saxena and to computational complexity theory developed by Stephen Cook and Richard Karp.

Category:Number theory