ConceptTheory & Algos
Euler's theorem
A generalisation of Fermat's Little Theorem stating that raised to the power of is congruent to modulo when and are coprime.
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 arithmetic3Euler's totient function2Coprime integers1Fermat's little theorem1Greatest common divisor1Lagrange's theorem1Relatively prime numbers1
Lecturers
3Each in their own terms, from the easiest level.
Ankur Moitra
A generalization of Fermat's Little Theorem stating a((p-1)(q-1)) ≡ 1 pmod m when for distinct primes and and .Tom Leighton
Euler's theorem states that if the GCD of n and k is 1, then k raised to the power of the totient function of n is congruent to 1 modulo n.
Connections
7The lectures that define it or assume it, and the concepts next to it.