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.
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
2Each in their own terms, from the easiest level.
Nickolai Zeldovich
A theorem stating that a system of congruences with pairwise coprime moduli has a unique solution modulo the product of the moduli.
Connections
7The lectures that define it or assume it, and the concepts next to it.