Difference between revisions of "Diophantine equation"
m (stubbed) |
m (proofreading) |
||
| Line 3: | Line 3: | ||
has [[infinite]]ly many solutions, two of which are <math>(1,2)</math> and <math>(4,-2)</math>. | has [[infinite]]ly many solutions, two of which are <math>(1,2)</math> and <math>(4,-2)</math>. | ||
| − | Finding the solution or solutions to a | + | 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. |
==See also== | ==See also== | ||
Revision as of 12:08, 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 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.
See also
This article is a stub. Help us out by expanding it.
