Diophantine Equation

Bal Bahadur Tamang

June 24, 2019

1 Introduction
In mathematics a Diophantine equation is a polynomial equation, usually in
two or more unknowns such that only the integer solutions are studied (an
integer solution is a solution such that all the unknowns take integer values).
A linear Diophantine equation equates the sum of two or more monomials,
each of degree 1 in one of the variables, to a constant. Solving a linear Dio-
phantine equation means that you need to find solutions for the variables
x and y that are integers only. Finding integral solutions is more difficult
than a standard solution and requires an ordered pattern of steps. We find
the greatest common factor of the coefficients in the problem and then use
that result to find a solution. If we can find one integral solution to a linear
equation, then we can apply a simple pattern to find infinitely many more.
Any linear equation in two variables having integral coefficients can be put
in the from ax + by = c, where a, b, c. are given integers. To identify all
solutions of this equation in which x and y are integers. If a = b = c = 0.
Then every pair (x, y) of integers is a solutions of given equation. But, if
a = b = 0 and c 6= 0. Now, suppose that at least one of a and b is nonzero,
and let g = g.c.d(a, b). If g - c, then the given equation has no solution. If
g | c, then there exists integers x0 , y0 such that ax0 + by0 = g. Thus, the
pair ( cxg0 , cyg0 ) is an integral solution of given equation. We may define find
x0 and y0 by the Euclidean Algorithm. Once a single solution is known, say
ax1 + by1 = c, others are given by taking x = x1 + kb g
, y = y1 − ka
g
. Here k is
an arbitrary. Hence the given equation has infinitely many integral solutions,
if it has one. Suppose that the pairs (x1 , y1 ), (x, y) are integral solutions of
given equation. By subtract, we find that a(x − x1 ) + b(y − y1 ) = 0. We
divide by g and rearrange to see that

1
( ag )(x − x1 ) = ( gb )(y1 − y). That is ( ag ) divides the product ( gb )(y1 − y). But
( ag , gb ) = 1. It follows that ( ag ) divides y − y1 . That is ( kag
) = y1 − y for
some integer k. On substituting this in the given equation, we find that
x − x1 = kb g
.
Theorem
Let a, b and c be integers with not both a and b equal to 0. And
let g = g.c.d.(a, b). If g - c, then the equation ax + by = c, where a, b, c. are
given integers, has no solution in integers. If g | c, then this equation has
infinitely many solutions. If the pair (x1 , y1 ) is one integral solution, then all
1
1 1
others are of the form x = x1 + kb , y = y1 + ka . 1 2 1
g g
1 3 3 1
1 4 6 4 1