 Diophantine equation

In mathematics, a Diophantine equation is an indeterminate polynomial equation that allows the variables to be integers only. Diophantine problems have fewer equations than unknown variables and involve finding integers that work correctly for all equations. In more technical language, they define an algebraic curve, algebraic surface, or more general object, and ask about the lattice points on it.
The word Diophantine refers to the Hellenistic mathematician of the 3rd century, Diophantus of Alexandria, who made a study of such equations and was one of the first mathematicians to introduce symbolism into algebra. The mathematical study of Diophantine problems Diophantus initiated is now called "Diophantine analysis". A linear Diophantine equation is an equation between two sums of monomials of degree zero or one.
While individual equations present a kind of puzzle and have been considered throughout history, the formulation of general theories of Diophantine equations (beyond the theory of quadratic forms) was an achievement of the twentieth century.
Contents
Examples of Diophantine equations
In the following Diophantine equations, x, y, and z are the unknowns, the other letters being given are constants. This is a linear Diophantine equation (see the section "Linear Diophantine equations" below). For n = 2 there are infinitely many solutions (x,y,z), the Pythagorean triples. For larger values of n, Fermat's Last Theorem states that no positive integer solutions (x, y, z) satisfying the equation exist. (Pell's equation) which is named after the English mathematician John Pell. It was studied by Brahmagupta in the 7th century, as well as by Fermat in the 17th century. The Erdős–Straus conjecture states that, for every positive integer n ≥ 2, there exists a solution with x, y, and z all positive integers. Although not usually stated in polynomial form, this example is equivalent to the polynomial equation 4xyz = yzn + xzn + xyn = n(yz + xz + xy). Diophantine analysis
Typical questions
The questions asked in Diophantine analysis include:
 Are there any solutions?
 Are there any solutions beyond some that are easily found by inspection?
 Are there finitely or infinitely many solutions?
 Can all solutions be found in theory?
 Can one in practice compute a full list of solutions?
These traditional problems often lay unsolved for centuries, and mathematicians gradually came to understand their depth (in some cases), rather than treat them as puzzles.
Typical problem
Given that a father's age is 1 less than twice that of his son, and that the digits AB making up the father's age are reversed in the son's age ie. BA. This leads to the equation 19B  8A = 1. Inspection gives the result 73 and 37 years.
17th and 18th centuries
In 1637, Pierre de Fermat scribbled on the margin of his copy of Arithmetica: "It is impossible to separate a cube into two cubes, or a fourth power into two fourth powers, or in general, any power higher than the second into two like powers." Stated in more modern language, "The equation a^{n} + b^{n} = c^{n} has no solutions for any n higher than two." And then he wrote, intriguingly: "I have discovered a truly marvelous proof of this, which, however, the margin is not large enough to contain." Such a proof eluded mathematicians for centuries, however. As an unproven conjecture that eluded brilliant mathematicians' attempts to either prove it or disprove it for generations, his statement became famous as Fermat's Last Theorem. It wasn't until 1994 that it was proven by the British mathematician Andrew Wiles.
In 1657, Fermat attempted the Diophantine equation 61x^{2} + 1 = y^{2} (solved by Brahmagupta over 1000 years earlier). The equation was eventually solved by Euler in the early 18th century, who also solved a number of other Diophantine equations.
Hilbert's tenth problem
In 1900, in recognition of their depth, David Hilbert proposed the solvability of all Diophantine problems as the tenth of his celebrated problems. In 1970, a novel result in mathematical logic known as Matiyasevich's theorem settled the problem negatively: in general Diophantine problems are unsolvable.
Diophantine geometry, which is the application of techniques from algebraic geometry in this field, has continued to grow as a result; since treating arbitrary equations is a dead end, attention turns to equations that also have a geometric meaning. The central idea of Diophantine geometry is that of a rational point, namely a solution to a polynomial equation or system of simultaneous equations, which is a vector in a prescribed field K, when K is not algebraically closed.
Modern research
One of the few general approaches is through the Hasse principle. Infinite descent is the traditional method, and has been pushed a long way.
The depth of the study of general Diophantine equations is shown by the characterisation of Diophantine sets as equivalently described as recursively enumerable. In other words, the general problem of Diophantine analysis is blessed or cursed with universality, and in any case is not something that will be solved except by reexpressing it in other terms.
The field of Diophantine approximation deals with the cases of Diophantine inequalities. Here variables are still supposed to be integral, but some coefficients may be irrational numbers, and the equality sign is replaced by upper and lower bounds.
The most celebrated single question in the field, the conjecture known as Fermat's Last Theorem, was solved by Andrew Wiles^{[1]} but using tools from algebraic geometry developed during the last century rather than within number theory where the conjecture was originally formulated. Other major results, such as Faltings' theorem, have disposed of old conjectures.
Infinite Diophantine Equations
An example of an infinite diophantine equation is:
 N = A^{2} + 2B^{2} + 3C^{2} + 4D^{2} + 5E^{2} + ....
which can be expressed as "How many ways can a given integer (N) be written as the sum of a square plus twice a square plus thrice a square and so on?" The number of ways this can be done for each N forms an integer sequence. Infinite Diophantine equations are related to theta functions and infinite dimensional lattices. This equation always has a solution for any positive N. Compare this to:
 N = A^{2} + 4B^{2} + 9C^{2} + 16D^{2} + 25E^{2} + ....
which doesn't always have a solution for positive N.
Linear Diophantine equations
For more details on this topic, see Bézout's identity.Linear Diophantine equations take the form ax + by = c. If c is the greatest common divisor of a and b then this is Bézout's identity, and the equation has an infinite number of solutions. These can be found by applying the extended Euclidean algorithm. It follows that there are also infinite solutions if c is a multiple of the greatest common divisor of a and b. If c is not a multiple of the greatest common divisor of a and b, then the Diophantine equation ax + by = c has no solutions.
Exponential Diophantine equations
If a Diophantine equation has as an additional variable or variables occurring as exponents, it is an exponential Diophantine equation. One example is the Ramanujan–Nagell equation, 2^{n} − 7 = x^{2}. Such equations do not have a general theory; particular cases such as Catalan's conjecture have been tackled, however the majority are solved via ad hoc methods such as Størmer's theorem or even trial and error.
Notes
References
 Mordell, L. J. (1969). Diophantine equations. Academic Press. ISBN 0125062508.
 Schmidt, Wolfgang M. (2000). Diophantine approximations and Diophantine equations. Lecture Notes in Mathematics. SpringerVerlag.
 Shorey, T. N.; Tijdeman, R. (1986). Exponential Diophantine equations. Cambridge Tracts in Mathematics. 87. Cambridge University Press. ISBN 0521268265.
 Smart, N. P. (1998). The algorithmic resolution of Diophantine equations. London Mathematical Society Student Texts. 41. Cambridge University Press. ISBN 052164156X.
 Stillwell, John (2004). Mathematics and its History (Second Edition ed.). Springer Science + Business Media Inc.. ISBN 0387953361.
External links
 Diophantine Equation. From MathWorld at Wolfram Research.
 Diophantine Equation. From PlanetMath.
 Hazewinkel, Michiel, ed. (2001), "Diophantine equations", Encyclopaedia of Mathematics, Springer, ISBN 9781556080104, http://eom.springer.de/d/d032610.htm
 Dario Alpern's Online Calculator. Retrieved 18 March 2009
Categories: Diophantine equations
Wikimedia Foundation. 2010.
Look at other dictionaries:
diophantine equation — /duy euh fan tuyn, teen, fan tn/, Math. an equation involving more than one variable in which the coefficients of the variables are integers and for which integral solutions are sought. [1925 30; named after Diophantus, 3rd century A.D. Greek… … Universalium
Diophantine equation — noun Etymology: Diophantus, 3d century A.D. Greek mathematician Date: circa 1928 an indeterminate polynomial equation which has integral coefficients and for which it is required to find all integral solutions … New Collegiate Dictionary
Diophantine equation — noun A polynomial equation whose variables are only permitted to assume integer values … Wiktionary
Diophantine equation — [ˌdʌɪə fantɪn, tʌɪn] noun Mathematics a polynomial equation with integral coefficients for which integral solutions are required. Origin C18: named after the third cent. Greek mathematician Diophantus … English new terms dictionary
Diophantine equation — /daɪəfæntaɪn əˈkweɪʒən/ (say duyuhfantuyn uh kwayzhuhn) noun an indeterminate equation with integral coefficients, in which the variables can take only integral values. {from Diophantus, fl. 3rd century AD, Greek mathematician} … Australian English dictionary
diophantine equation — n. Math. an equation with integral coefficients for which integral solutions are required. Etymology: Diophantus of Alexandria, mathematician of uncert. date … Useful english dictionary
Polynomial Diophantine equation — In mathematics, a polynomial Diophantine equation is an indeterminate polynomial equation whose solutions are restricted to be polynomials in the indeterminate. A Diophantine equation, in general, is one where the solutions are restricted to some … Wikipedia
Equation diophantienne — Équation diophantienne Édition de 1670 des Arithmétiques de Diophante d Alexandrie. Une équation diophantienne, en mathématiques, est une équation dont les coefficients sont des nombres entiers et dont les solutions recherchées sont également… … Wikipédia en Français
Diophantine — means pertaining to the ancient Greek mathematician Diophantus. A number of concepts bear this name: Diophantine approximation Diophantine equation Diophantine set This disambiguation page lists articles associated with the same title. If an … Wikipedia
Diophantine set — In mathematics, a Diophantine equation is an equation of the form P(x1, ..., xj, y1, ..., yk)=0 (usually abbreviated P(x,y)=0 ) where P(x,y) is a polynomial with integer coefficients. A Diophantine set is a subset S of Nj [1] so that for some… … Wikipedia