bn:03645820n
Noun Concept
Categories: Modular arithmetic, Chinese mathematical discoveries, Articles with short description, Theorems in number theory, long volume value
EN
Chinese remainder theorem  Aryabhata Algorithm  Formosa theorem  Simultaneous congruence  Chinese theorem
EN
In mathematics, the Chinese remainder theorem states that if one knows the remainders of the Euclidean division of an integer n by several integers, then one can determine uniquely the remainder of the division of n by the product of these integers, under the condition that the divisors are pairwise coprime. Wikipedia
Definitions
Relations
Sources
EN
In mathematics, the Chinese remainder theorem states that if one knows the remainders of the Euclidean division of an integer n by several integers, then one can determine uniquely the remainder of the division of n by the product of these integers, under the condition that the divisors are pairwise coprime. Wikipedia
Theorem for solving simultaneous congruences Wikidata
IS A