On Sun, Dec 14, 2008 at 10:53 PM, John H Palmieri <[email protected]> wrote: > > I have some code which generates a bunch of expressions of the form > Sum (n_i a_i) where each n_i is an integer and each a_i is an unknown > in a field, and I'm most interested in the case when the field is GF > (p). Set each of these expressions equal to zero. What's the best way > in Sage to solve the resulting system of equations for the a_i's? > > For example, I can't figure out how to use 'solve', because I can't > figure out how to insist that the variables be treated as elements of > a particular field. Is the only way to convert everything to a matrix > equation?
Is p big or small? Just to be clear above, are you *really* just solving a system of linear equations modulo p? William --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
