Difference between revisions of "Diophantine equation"
(Started article) |
m (stubbed) |
||
| Line 7: | Line 7: | ||
==See also== | ==See also== | ||
* [[number theory | Number Theory]] | * [[number theory | Number Theory]] | ||
| + | |||
| + | {{stub}} | ||
Revision as of 11:41, 23 June 2006
A Diophantine equation is an equation which must be solved using only integers. For instance, the Diophantine equation
has infinitely many solutions, two of which are 
and 
.
Finding the solution or solutions to a Diophatine 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.
See also
This article is a stub. Help us out by expanding it.
