


Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
The problem of finding integral solutions to linear diophantine equations, specifically focusing on the general linear diophantine equation in two variables. The case when the constant term is zero and when it is arbitrary, providing solutions and explanations. A specific example is given to find all solutions for the equation 258x + 147y = 369.
Typology: Study notes
1 / 4
This page cannot be seen from the preview
Don't miss anything!



where a, b and c ∈ Z. Our goal is to describe all solutions (x, y) with integer coordinates, x ∈ Z and y ∈ Z. Geometrically the equation ax + by = c describes a line in the plane R^2. It is possible that this line misses the integral points Z^2. However if there is one integral point on the line then there are infinitely many. We first start by solving a special case, when c = 0 and (a, b) = 1. When c = 0 one solution is clear x = y = 0, the origin (0, 0) is a point of the line ax + by = 0.
On the hand we could increase x by b and decrease y by a, to get another point (b, −a) of the line. More generally if k ∈ Z is an integer then could we could increase x by kb and decrease y by ka, to get another point (kb, −ak) of the line. On the other hand, if you consider the equation ax = −by,
it is clear that every point of the line has the form (bt, −at), for some real number t. For this to be an integer point, t = k/l has to be rational, where k and l > 0 are coprime integers and we must have bk/l ∈ Z and ak/l ∈ Z. Suppose that l 6 = 1. Then some prime p divides l. p does not divide k, as (k, l) = 1 and p does not divide both a and b, as (a, b) = 1, a contradiction. Thus t = k and the general solution to the equation ax + by = 0
is (kb, −ka), where k ∈ Z is an integer. Now we turn to the case when (a, b) = 1 but c is arbitrary. In this case we may find (λ, μ) such that λa + μb = 1. If we multiply this equation by c then we get
a(cλ) + b(cμ) = c.
Hence, if we put
x 0 = cλ and y 0 = cμ
then (x 0 , y 0 ) is a solution of the equation ax + by = c. Suppose that (x, y) is another solution, so that
ax 0 + by 0 = c ax + by = c.
If we subtract the first equation from the second equation we get
a(x − x 0 ) + b(y − y 0 ) = 0.
We have already seen that the general solution of this equation is
(x − x 0 , y − y 0 ) = (bk, −ak),
so that the general solution of the equation ax + by = c is
x = x 0 + bk and y = y 0 − ak,
where k is an integer. Finally suppose that (a, b) = d. If we can solve ax + by = c then c must be a multiple of d. In this case consider the equation
(a/d)x + (b/d) = c/d.
As d|a, d|b and d|c this is a linear Diophantine equation. (a/d, b/d) = 1 and so the general solution to this equation is
x = x 0 +
kb d
and y = y 0 −
ka d
where (x 0 , y 0 ) is one solution and k is an integer.
Question 6.1. Find all solutions of the linear Diophantine equation
258 x + 147y = 369. We first find the greatest common divisor of 258 and 147. Note that both 258 and 147 are divisible by 3, 258 = 3 · 86 and 147 = 3 · 49. As 49 = 7^2 is coprime to 66 = 6 · 11, the greatest common divisor of 258 and 147 is 3. As 369 is a multiple of 3 it follows that the linear Diophantine equation
258 x + 147y = 369
has a solution. Since we want to solve a linear Diophantine equation we still have to run Euclid’s algorithm.
258 = 1 · 147 + 111 147 = 1 · 111 + 36 111 = 3 · 36 + 3 36 = 12 · 3 + 0.
It is therefore guaranteed that there is a integral solution in the first quadrant if c ab
d
and d|c.