Hi, Does Macaulay2 actually have a function to enumerate the solutions to some equations modulo n? I'm guessing not otherwise William would have used that in solve_mod().
Here we have a+b+2=0 and a+3=0 all done modulo 5: sage: R.<a,b> = ZZ[] sage: I = ideal([a+b+2, a+3, 5]) sage: print I.groebner_basis() [5, b - 1, a - 2] So even in this simple example, I need to work out b = 1 in Sage myself, and then solve the rest? I have a situation where I need solutions with a != b and other conditions, so I've written most of a solver, but I wanted to check if anyone knows a better way for the general case. -- Carlo Hamalainen http://carlo-hamalainen.net --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
