Linear Diophantine equation
Summary
A linear Diophantine equation in two unknowns is an equation with given integers , and . Its solutions are the pairs of integers that satisfy it. When and are not both , the equation has an integer solution if and only if divides . In this case, let and let be one solution. Then the solutions are the pairs with an integer.
Remarks
Bézout's identity gives the existence of a solution, and the extended Euclidean algorithm computes one. For example, has no integer solution, because does not divide . The equation is a special case of a Diophantine equation.
Further reading
- Web https://en.wikipedia.org/wiki/Diophantine_equation, Linear Diophantine equations
About this page
| Tag | 0R9GF3JD0K |
|---|---|
| URI | m2://0R9GF3JD0K |
| Kind | concept |
| Writing | W1 stated |
| MSC | 11D04 |
| Specializes | Diophantine equation |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.