perhaps the comma from the link must be deleted: http://tinyurl.com/3atamuj otherwise, http://www.cargalmathbooks.com/11%20Division%20Mod%20n.pdf
The CRT would solve the first problem where all moduli are prime, but the 2nd problem has a composite modulus. Hector is working on a congruence solver and that is nearly ready (so that would solve the first problem) but I'm wondering if we should have some ModulusNumber class to allow for such simple arithmetic as presented in the 2nd problem. There is an old posting giving such a class at http://www.python.org/search/hypermail/python-1994q1/0523.html There is also the online calculator at http://ptrow.com/perl/calculator.pl Thanks for the suggestions, /c -- You received this message because you are subscribed to the Google Groups "sympy" group. To post to this group, send email to sympy@googlegroups.com. To unsubscribe from this group, send email to sympy+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sympy?hl=en.
