# known methods for solving diophantine systems?nt [closed]

Are there any known non-slow methods for solving diophantine systems?

I can't find books of mathematics that appear methods explaining how to solve diophantine systems in a manner "not slow", e.g. not force brute enumeration.

-

## closed as too localized by Andrés Caicedo, Mark Sapir, Will Jagy, Felipe Voloch, José Figueroa-O'FarrillDec 14 '10 at 2:59

This question is unlikely to help any future visitors; it is only relevant to a small geographic area, a specific moment in time, or an extraordinarily narrow situation that is not generally applicable to the worldwide audience of the internet. For help making this question more broadly applicable, visit the help center.If this question can be reworded to fit the rules in the help center, please edit the question.

Which diophantine systems? Linear systems are very well understood (see, eg, the vast literature on "integer programming"), quadratic equations well understood for a couple of centuries (search for "Pell's equation"), general nonlinear systems undecidable. So, take your pick. – Igor Rivin Dec 14 '10 at 1:58
In addition to Igor's comment there is a Matiyasevich's theorem that the general biquadratic equation cannot be solved algorithmically. But there is an open problem is any cubic equation is solvable algorithmically or not ;) – zroslav Dec 14 '10 at 2:03
Voted to close. The OP did not even google "Diophantine equations". – Mark Sapir Dec 14 '10 at 2:32
To user h10, Hilbert's 10th problem is for one equation, it's not enough for a system of equations. – Ecologicyborg Dec 14 '10 at 2:33
@Ecologicyborg: If one equation is bad, a system is worse. – Felipe Voloch Dec 14 '10 at 2:42

You must not have looked very hard. This will get you started:

Nigel P. Smart. The Algorithmic Resolution of Diophantine Equations. London Mathematical Society Student Texts 41. Cambridge University Press, 1998.

However, as Igor and zroslav have mentioned, some problems are unsolvable, others believed to be very hard, so don't be surprised that there are no "easy" methods.

-
-