Template:AotD

Revision as of 18:05, 17 December 2007 by Temperal (talk | contribs) (nw aotd)

Diophantine equation

Awards.gif This article was also a AoPSWiki word of the week


A Diophantine equation is an multi-variable equation for which integer solutions (or sometimes natural number or whole number solutions) are to be found.

Finding the solution or solutions to a Diophantine equation is closely tied to modular arithmetic and number theory. Often, when a Diophantine equation has infinitely many solutions, parametric form is used to express the relation between the variables of the equation.

Diophantine equations are named for the ancient Greek/Alexandrian mathematician Diophantus.

A Diophantine equation in the form $ax+by=c$ is known as a linear combination. If two relatively prime integers $a$ and $b$ are written in this form with $c=1$, the equation will have an infinite number of solutions. More generally, there will always be an... [more]