Chinese remainder theorem

E530312

The Chinese remainder theorem is a fundamental result in number theory that provides conditions and a method for solving systems of simultaneous congruences with pairwise coprime moduli.

All labels observed (5)

How this entity was disambiguated

Statements (49)

Predicate Object
instanceOf result in number theory ⓘ
theorem ⓘ
appearsIn Sunzi Suanjing ⓘ
appliesTo modular arithmetic ⓘ
systems of congruences with pairwise coprime moduli ⓘ
associatedWith Sunzi ⓘ
category arithmetic theorems ⓘ
theorems in abstract algebra ⓘ
describes solutions of systems of simultaneous congruences ⓘ
ensures every residue system modulo product corresponds to a tuple of residues modulo each modulus ⓘ
field number theory ⓘ
formalizes reconstruction of integers from residue classes ⓘ
hasAlternativeName CRT ⓘ
hasFormulation integer arithmetic formulation ⓘ
ring-theoretic formulation ⓘ
hasGeneralization Chinese remainder theorem for ideals ⓘ
Chinese remainder theorem for rings ⓘ
Chinese remainder theorem in commutative algebra ⓘ
hasHistoricalOrigin ancient Chinese mathematics ⓘ
hasProofTechnique constructive proof using modular inverses ⓘ
proof using Bezout coefficients ⓘ
proof using ring isomorphisms ⓘ
implies isomorphism Z/(n1⋯nk)Z ≅ Z/n1Z × ⋯ × Z/nkZ for pairwise coprime ni ⓘ
involves congruence relations ⓘ
moduli ⓘ
pairwise coprime integers ⓘ
provides existence conditions for simultaneous solutions ⓘ
uniqueness conditions for simultaneous solutions modulo the product of the moduli ⓘ
relatedTo Bezout's identity ⓘ
Euclidean algorithm ⓘ
direct product of rings ⓘ
modular inverses ⓘ
ring isomorphisms ⓘ
requiresCondition pairwise coprimality of moduli ⓘ
states if moduli are pairwise coprime then a simultaneous solution exists ⓘ
if moduli are pairwise coprime then the solution is unique modulo the product of the moduli ⓘ
subfield elementary number theory ⓘ
usedFor calendar calculations ⓘ
clock arithmetic problems ⓘ
solving congruence-based puzzles ⓘ
speeding up modular exponentiation ⓘ
usedIn RSA algorithm ⓘ
linked to: RSA

algorithmic Chinese remainder representation of integers ⓘ
coding theory ⓘ
computational number theory ⓘ
computer algebra systems ⓘ
cryptography ⓘ
integer reconstruction from residues ⓘ
parallel computation of modular operations ⓘ

How these facts were elicited

Referenced by (7)

Full triples — surface form annotated when it differs from this entity's canonical label.

Fermat's little theorem → relatedTo → Chinese remainder theorem ⓘ
ring theory → usesConcept → Chinese remainder theorem ⓘ
Euler’s theorem → relatedTo → Chinese remainder theorem ⓘ
Chinese remainder theorem → hasGeneralization → Chinese remainder theorem for rings ⓘ
linked to: Chinese remainder theorem
Chinese remainder theorem → hasGeneralization → Chinese remainder theorem for ideals ⓘ
linked to: Chinese remainder theorem
Schoof–Elkies–Atkin (SEA) point-counting algorithm → property → uses Chinese remainder theorem ⓘ
linked to: Chinese remainder theorem
Rabin cryptosystem → mathematicalTool → Chinese Remainder Theorem ⓘ
linked to: Chinese remainder theorem