What kind of diophantine equations exactly are they? We already can solve certain "diophantine equations", namely a*x + b*y = 1, where a and b are given and coprime (this is the extended Euclidean algorithm, and is accessed through gcdex). The more general form, a*x + b*y = c, where a, b, and c are given, is also solved in the same way.
Aaron Meurer On Fri, Feb 8, 2013 at 9:52 AM, Matthew Rocklin <[email protected]> wrote: > I'm looking at implementing a matching algorithm that requires the solution > of linear diophantine equations. My understanding is that we don't have > support for this. How challenging are algorithms for the solution of > diophantine equations? I'm trying to gauge the cost of pursuing my current > path. > > -- > You received this message because you are subscribed to the Google Groups > "sympy" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > To post to this group, send email to [email protected]. > Visit this group at http://groups.google.com/group/sympy?hl=en. > For more options, visit https://groups.google.com/groups/opt_out. > > -- You received this message because you are subscribed to the Google Groups "sympy" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sympy?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
