Hi list
I have to solve congruences like
a x \equiv b mod n
for given a,b,n.
how can i do this with sage?greatz Johanens -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
