Sign inSign in
ConceptMathematics

Chinese remainder theorem

A theorem stating that if moduli are relatively prime, a system of linear congruences has a unique solution modulo their product.
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.

Modular arithmetic2Euclidean algorithm1Prime number1Relatively prime integers1Relatively prime numbers1Systems of congruences1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Nickolai Zeldovich

    MIT · Undergraduate

    A theorem stating that a system of congruences with pairwise coprime moduli has a unique solution modulo the product of the moduli.
    • 20:57Side-Channel Attacks

Connections

7

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

Concepts5

Lectures2

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