On Sep 23, 4:16 am, smichr <[email protected]> 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)
You mean the Chinese remainder theorem? I think someone on the list once stated interest in implementing this, I don't know how far it got though. > and operations modulo n, e.g., fromhttp://tinyurl.com/3atamuj, Your link does not work for me. > the following question: > > In Z_12, divide 4 by 2, 3, 5, 7,8, and 11 > > Do we have support for such things? We have support for finite fields in polys. See FF() for example. Documentation on this is sparse however. Vinzent -- You received this message because you are subscribed to the Google Groups "sympy" group. 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/sympy?hl=en.
