Sign inSign in

Fermat's little theorem

A theorem stating that aᵖ⁻¹ ≡ 1 pmod p for any prime pp and integer aa not divisible by pp.
as Christof Paar defines itRuhr University BochumThe wording closest to all 8 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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

5

Each in their own terms, from the easiest level.

  • Christof Paar

    Ruhr University Bochum · Undergraduate

    A number theory theorem stating that aᵖ ≡ a pmod p for a prime pp.
    • 1:28:28Number Theory for PKC: Euclidean Algorithm, Euler's Phi Function & Euler's Theorem
    • 1:07:41Diffie-Hellman Key Exchange and the Discrete Log Problem
    • 1:00:29Elgamal Encryption Scheme
  • Ankur Moitra

    MIT · Undergraduate

    A theorem stating that if p is a prime and a is not divisible by p, then ap−1a^{p-1} is congruent to 1 modulo p.
  • Srini Devadas

    MIT · Undergraduate

    A number theory theorem stating that if pp is a prime number, then for any integer mm, mp−mm^p - m is an integer multiple of pp, or mᵖ⁻¹ ≡ 1 (mod p) when mm is not divisible by pp.
    • 49:01Cryptography: Encryption
  • Tom Leighton

    MIT · Undergraduate

    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

    Carnegie Mellon University · Graduate

    A theorem stating that xq−xx^q - x is always zero when qq is a prime.
    • 4:14Multivariate Polynomials and the Schwartz Zippel Lemma

Connections

17

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

5 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.