next | previous | forward | backward | up | top | index | toc | Macaulay2 web site
Parametrization :: chineseRemainder

chineseRemainder -- Solve simultaneous congruences.

Synopsis

Description

Solves the simultaneous congruences x=L#i mod M#i.

i1 : chineseRemainder({1,2,3},{3,5,7})

o1 = 52

Caveat

This should be extended slightly to non prime integers.

Ways to use chineseRemainder :