M, a list, of positive integers, which are relatively prime.
Outputs:
x, an integer, an integer x between 0 and the product of the entries of M minus 1 representing the solution of the simultaneous congruences x=L#i mod M#i.
Description
Solves the simultaneous congruences x=L#i mod M#i.
-- -*- M2-comint -*- {* hash: 774052082 *}
Caveat
This should be extended slightly to non prime integers.