thnx, that looks exactly like what i was looking for. Am 26.07.2011 23:26, schrieb D. M. Monarres: > I use the 'solve_mod' command: > > sage: solve_mod(3*x == 2, 4) > [(2,)] > sage: solve_mod(3*x == 1, 4) > [(3,)] > sage: solve_mod(2*x == 1, 4) > [] > sage: solve_mod(2*x == 1, 7) > [(4,)] > sage: solve_mod(2*x == 1, 7) > [(4,)] > > > Check the help (solve_mod?) for more info/examples of its use. > > Regards, > > David M. Monarres > <dmmonar...@gmail.com> > > > > On Tue, Jul 26, 2011 at 2:19 PM, Johannes <dajo.m...@web.de> wrote: >> 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 >> >
-- 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
