-
MathType
-
Wiris Quizzes
-
Learning Lemur
-
CalcMe
-
MathPlayer
-
Store FAQ
-
VPAT for the electronic documentation
-
MathFlow
-
BF FAQ
Chinese theorem
Reading time: 1minReturns the solution of the system of equations given by the Chinese theorem: let n1,...,nk be integers greater than 1, and let us denote by N the product of the ni. The Chinese remainder theorem states that if the ni are pairwise coprime, and if a1,...,ak are any integer, 0≤ai<ni, then there exists an integer x such that
x≡a1(modn1)
x≡ak(modnk)
and two such x are congruent modulo N.
Syntax
chinese_theorem(Integer, Integer, Integer, Integer)
chinese_theorem(List, List)
Description
Given four integers a1, a2, n1, n2, returns x, the solution of the system of equations described above.
.png)
Given two lists {a1,...,ak} and {n1,...,nk}, returns x, the solution of the system of equations described above
