Does anyone know of software (either commercial or free/open) that implements the general algorithm to solve quadratic diophantine equations as shown in this paper by Grunewald and Segal (2004), entitled 'On the integer solutions of quadratic equations'? http://thirdworld.nl/on-the-integer-solutions-of-quadratic-equations

  • $\begingroup$ Why do the program? Often you can record a parameterization of solutions in General. Depends on which equation you need to solve it. Formulate the question more specifically. $\endgroup$ – individ Jul 12 '16 at 4:27
  • $\begingroup$ I'm particularly interested in all finite solutions. The method linked above can give me all of those in general. My specific question is whether anyone knows of an implementation of that specific algorithm. $\endgroup$ – melodrama Jul 12 '16 at 17:03
  • $\begingroup$ Specify the question more clearly. And depending on the equation - write a specific formula. Even without the algorithm to do in some cases. $\endgroup$ – individ Jul 12 '16 at 17:16
  • $\begingroup$ I'm not interested in the handful of known special cases. I'm interested in the algorithm proved in that paper to solve the general case of quadratic equations. The question is straightforward. Is there software available that implements the algorithm described in the manuscript? I know that some special case is NP-Complete. If it's inefficient, that's okay. It is a tool that should exist. I am asking if it exists yet. $\endgroup$ – melodrama Jul 12 '16 at 21:34
  • $\begingroup$ Yes, of course - there. It is even possible to decide unambiguously and in a General way to record the decision. Depending on the equation formula can take many forms. Most often they are quite bulky. To make it easier to simplify and solve - it is necessary to know what form of the equation presented. $\endgroup$ – individ Jul 13 '16 at 4:22

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.