ConceptTheory & Algos
Fermat's little theorem
A theorem stating that aᵖ⁻¹ ≡ 1 pmod p for any prime and integer not divisible by .
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Modular arithmetic8Prime number4Combinatorics1Finite field1Group1Group theory1Lagrange's theorem1Primes1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
5Each in their own terms, from the easiest level.
Christof Paar
A number theory theorem stating that aᵖ ≡ a pmod p for a prime .Ankur Moitra
A theorem stating that if p is a prime and a is not divisible by p, then is congruent to 1 modulo p.Srini Devadas
A number theory theorem stating that if is a prime number, then for any integer , is an integer multiple of , or mᵖ⁻¹ ≡ 1 (mod p) when is not divisible by .Tom Leighton
States that if p is prime, then for any integer k not divisible by p, k to the power p minus 1 is congruent to 1 modulo p.Ryan O'Donnell
A theorem stating that is always zero when is a prime.
Connections
17The lectures that define it or assume it, and the concepts next to it.