Hi, Although it seems that this thread has not been active for a while, I venture to post a related question:
Is it possible to find all solutions to a linear Diophantine equation modulo some integer m i.e. find all solutions (x,y) to the equation: a x + b y = c (mod m) for fixed integers a,b,c? Thanks! -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To post to this group, send email to sage-support@googlegroups.com. Visit this group at http://groups.google.com/group/sage-support?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
