I want to find integer such that x= 1 mod 3 x=2 mod 5 x=3 mod 7 like this system of congruences using Chinese Remainder Theorem. In Sage, crt() function takes only 4 argument.
-- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
