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 = .

ExamplesExamplesopen allclose all

Basic Examples  (2)Basic Examples  (2)

The smallest positive integer x that satisfies and :

In[1]:=
Click for copyable input
Out[1]=

Find the smallest positive integer giving remainder when divided by :

In[1]:=
Click for copyable input
Out[1]=
Introduced in 2007
(6.0)
Translate this page: