Are you looking for the chinese remainder theorem? If so, perhaps http://sympy.googlecode.com/svn/api/sympy.polynomials.fast.modint.html#sympy.polynomials.fast.modint.crt might help.
On Fri, Sep 23, 2011 at 4:16 AM, smichr <smi...@gmail.com> wrote: > I'm not sure where to look in sympy for support of things like solving > congruence relationships (what number is 2 mod 3, 3 mod 5 and 2 mod 7; > answer 23 mod 105) and operations modulo n, e.g., from > http://tinyurl.com/3atamuj, > the following question: > > In Z_12, divide 4 by 2, 3, 5, 7,8, and 11 > > Do we have support for such things? > > -- > 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. > > -- 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.
