Solves a system of modular congruences.
ChineseRemainder[{r1, r2, …}, {m1, m2, …}]
ChineseRemainder[{r1, r2, …}, {m1, m2, …}, d]
ChineseRemainder[{1,2,3},{3,5,7}]
→ 52ChineseRemainder[{1, 2}, {3, 5}, 10]
→ 22ChineseRemainder[{}, {}]
→ ChineseRemainder[{}, {}]ChineseRemainder[{1, 2}, {3}]
→
ChineseRemainder::pilist: The arguments to ChineseRemainder must be two lists of integers of identical length, with the second list containing only positive integers.
ChineseRemainder[{1, 2}, {3}]