On May 15, 2011, at 22:30 , Santanu Sarkar wrote: > I want to find x using Chinese Remainder Theorem such that > > x=a_1 mod b_1 > x=a_2 mod b_2 > x=a_3 mod b_3 > x=a_4 mod b_4
Try sage: CRT? HTH Justin -- Justin C. Walker, Curmudgeon-at-Large () The ASCII Ribbon Campaign /\ Help Cure HTML Email -- 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
