|
|
| (36 intermediate revisions by the same user not shown) |
| Line 1: |
Line 1: |
| | <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | | <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> |
| − | ===[[Diophantine equation]]===
| + | Inactive. |
| − | {{WotWAlso}}
| |
| − | 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 <math>ax+by=c</math> is known as a linear combination. If two [[relatively prime]] integers <math>a</math> and <math>b</math> are written in this form with <math>c=1</math>, the equation will have an infinite number of solutions. More generally, there will always be an... [[Diophantine equation|[more]]]
| |
| | </blockquote> | | </blockquote> |
