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 12:41, 23 June 2006
A Diophantine equation is an equation which must be solved using only integers. For instance, the Diophantine equation
![$4a+3b=10$](http://latex.artofproblemsolving.com/a/4/9/a49699a226c97b45de2e59e9e230e9eaa5e0165b.png)
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.