ChineseRemainder

ChineseRemainder[{r1,r2,},{m1,m2,}]
gives the smallest nonnegative x that satisfies all the integer congruences x mod = mod .

DetailsDetails

  • If no solution for x exists, ChineseRemainder returns unevaluated.
  • If all , then the result satisfies x mod = .
Introduced in 2007
(6.0)