Skip to content

Diophantine solver example #47

LeventErkok opened this Issue May 4, 2012 · 1 comment

1 participant


Create an example for diophantine equation solving. Consider the quantified approach to the "minimal" set problem. Are the solutions required to be all positive? Then, how does one solve something like x+y+z = -2?



@LeventErkok LeventErkok closed this May 7, 2012
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Something went wrong with that request. Please try again.