Mathematica > Mathematics and Algorithms > Number Theory > Diophantine Equations > ChineseRemainder
BUILT-IN MATHEMATICA SYMBOL

ChineseRemainder

ChineseRemainder[{r1, r2, ...}, {m1, m2, ...}]
gives the smallest non-negative 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]=

Applications (3)Applications (3)

Properties & Relations (1)Properties & Relations (1)

Possible Issues (1)Possible Issues (1)

Top
New in 6
Send Feedback
Mathematica 9 is now available!

400+ new features, including the new Wolfram Predictive Interface, social network analysis, enterprise CDF deployment, and more »

Try Now
Buy/Upgrade
New to Mathematica? Find your learning path »
Have a question? Ask support »