Math 2.0

Number theory Concept

Linear Diophantine equation

Summary

A linear Diophantine equation in two unknowns is an equation ax+by=ca x + b y = c with given integers aa, bb and cc. Its solutions are the pairs of integers (x,y)(x, y) that satisfy it. When aa and bb are not both 00, the equation has an integer solution if and only if gcd⁡(a,b)\gcd(a, b) divides cc. In this case, let d=gcd⁡(a,b)d = \gcd(a, b) and let (x0,y0)(x_0, y_0) be one solution. Then the solutions are the pairs (x0+kb/d,  y0−ka/d)(x_0 + k b / d, \; y_0 - k a / d) with kk an integer.

Remarks

Bézout's identity gives the existence of a solution, and the extended Euclidean algorithm computes one. For example, 6x+10y=76 x + 10 y = 7 has no integer solution, because gcd⁡(6,10)=2\gcd(6, 10) = 2 does not divide 77. The equation is a special case of a Diophantine equation.

Further reading

  1. Web https://en.wikipedia.org/wiki/Diophantine_equation, Linear Diophantine equations
About this page
Tag0R9GF3JD0K
URIm2://0R9GF3JD0K
Kindconcept
WritingW1 stated
MSC11D04
SpecializesDiophantine 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.