In mathematics, a polynomial Diophantine equation is an indeterminate polynomial equation for which one seeks solutions restricted to be polynomials in the indeterminate. A Diophantine equation, in general, is one where the solutions are restricted to some algebraic system, typically integers. (In another usage ) Diophantine refers to the Hellenistic mathematician of the 3rd century, Diophantus of Alexandria, who made initial studies of integer Diophantine equations.
An important type of polynomial Diophantine equations takes the form:
where a, b, and c are known polynomials, and we wish to solve for s and t.
A simple example (and a solution) is:
A necessary and sufficient condition for a polynomial Diophantine equation to have a solution is for c to be a multiple of the GCD of a and b. In the example above, the GCD of a and b was 1, so solutions would exist for any value of c.
Solutions to polynomial Diophantine equations are not unique. Any multiple of (say ) can be used to transform and into another solution :
Some polynomial Diophantine equations can be solved using the extended Euclidean algorithm, which works as well with polynomials as it does with integers.
Famous quotes containing the word equation:
“Jail sentences have many functions, but one is surely to send a message about what our society abhors and what it values. This week, the equation was twofold: female infidelity twice as bad as male abuse, the life of a woman half as valuable as that of a man. The killing of the woman taken in adultery has a long history and survives today in many cultures. One of those is our own.”
—Anna Quindlen (b. 1952)