Sign inSign in

Euler's theorem

A generalisation of Fermat's Little Theorem stating that aa raised to the power of Φ(m)\Phi(m) is congruent to 11 modulo mm when aa and mm are coprime.
as Christof Paar defines itRuhr University BochumThe wording closest to all 3 definitions
Watch it explained

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.

Lecturers

3

Each in their own terms, from the easiest level.

  • Ankur Moitra

    MIT · Undergraduate

    A generalization of Fermat's Little Theorem stating a((p-1)(q-1)) ≡ 1 pmod m when m=pqm = pq for distinct primes pp and qq and gcd⁡(a,m)=1\gcd(a, m) = 1.
  • Tom Leighton

    MIT · Undergraduate

    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

7

The lectures that define it or assume it, and the concepts next to it.

3 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.