Linked from

The 28 pages that link to Fermat's little theorem, each with the reason it gives.

• Number theoryRelated: It provides a basic relation between prime moduli and powers, with applications in proofs and computation.

• Chinese remainder theoremCompared with: It concerns exponentiation modulo one prime rather than combining several congruences.

• Congruence (number theory)Related: It reduces large powers in calculations modulo a prime.

• Coprime integersRelated: Its condition that p does not divide a is exactly coprimality with p.

• Pierre de FermatBroader topic: This concise result exemplifies Fermat’s contributions to modular arithmetic and prime numbers.

• Dirichlet's theorem on arithmetic progressionsCompared with: It concerns modular arithmetic but does not assert primes occur in any progression.

• Primality testRelated: It supplies the algebraic condition behind Fermat testing and the probable-prime idea.

• Lagrange's theoremRelated: It follows by applying Lagrange’s theorem to the multiplicative group modulo p.

• Disquisitiones ArithmeticaeRelated: Gauss gives a systematic proof and uses the theorem within modular arithmetic.

• Euler's criterionRelated: Squaring the criterion's power yields the identity at the heart of Fermat's theorem.

• AKS primality testRelated: AKS replaces this familiar prime test's limited converse with a stronger polynomial identity.

• Fermat numberRelated: Its modular viewpoint underlies many elementary tests and divisibility arguments involving Fermat numbers.

• Fermat's theorem on sums of two squaresRelated: Its quadratic-residue consequences help establish that −1 is a square modulo primes congruent to 1 modulo 4.

• Solovay–Strassen primality testRelated: It provides the exponent relation from which prime-specific power tests are developed.

• Wilson's theoremRelated: It is a related prime-modulus result, though Wilson's criterion is an exact factorial test.

• Zsigmondy's theoremRelated: It bounds possible multiplicative orders modulo primes appearing in the theorem.

• Lifting-the-exponent lemmaRelated: It supplies congruences that can combine with LTE in divisibility calculations.

• PseudoprimeRelated: Its prime-number conclusion supplies the condition that Fermat pseudoprimes imitate.

• Sophie Germain's theoremRelated: Congruences derived from this theorem help control powers modulo p.

• Agoh–Giuga conjectureRelated: Applying it term by term makes the conjectured congruence immediate for prime n.

• Agrawal's conjectureRelated: Setting x to zero recovers this familiar necessary condition for primality.

• Artin's conjecture on primitive rootsRelated: It bounds every nonzero residue's order by p−1.

• Catalan–Mersenne conjectureRelated: Modular arithmetic helps analyze divisibility among terms generated by the recurrence.

• Chevalley–Warning theoremRelated: The identity turns field values into zero-or-one indicators in a standard proof.

• Lucas's theoremRelated: It is a common companion when simplifying modular expressions involving primes.

• Proth's theoremRelated: Its exponent congruence underlies the prime direction of Proth's test.

• Schinzel's theoremCompared with: It gives a universal modular identity, whereas Schinzel asserts existence of roots for selected primes.

• Wolstenholme's theoremRelated: It supplies basic reductions of powers modulo p used in proofs of reciprocal-sum congruences.