Scribd
Upload
10 views

Theorem 1.1

The document discusses linear Diophantine equations, which are polynomial equations that are only interested in integer solutions. It states that an equation of the form ax+by=d has an integer solution if and only if the greatest common divisor (GCD) of a and b divides d. It provides a proof and examples of finding integer solutions to such equations.

Uploaded by

rmbardhan.tripurauniv
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
10 views

Theorem 1.1

The document discusses linear Diophantine equations, which are polynomial equations that are only interested in integer solutions. It states that an equation of the form ax+by=d has an integer solution if and only if the greatest common divisor (GCD) of a and b divides d. It provides a proof and examples of finding integer solutions to such equations.

Uploaded by

rmbardhan.tripurauniv
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Ruhit Bardhan

MTTS, L’1-2022
IISER-TVM
Linear Diophantine Equation.

GCD Theorem: if a and b are two integers ( not both 0) , then a=ck1 b=ck2
gcd(a,b) is the smallest positive value of ax+by, where x and y are
ax0= ck1 x0 …… (i) by0=ck2 y0…… (ii)
integers. That is gcd(a,b) is the smallest positive linear combination
of a and b (proof: easy)

Diophantine Equation : As a result of above Theorem, we adding (i) and (ii)


know that for positive integers a and b, there exist integers r and y
such that ax + by = gcd (a, b). This leads us to the question: Given ax0+ by0 = ck1 x0+ ck2 y0
integers a, b, d, can we find a solution to the equation ax + by = d, d=c(k1 x0+ k2 y0)
where x and y are integers? An equation of this form, a polynomial
equation in which we are interested only in integer solutions, is ∴ 𝑐|𝑑
called a Diophantine equation.
conversely, let 𝑐|𝑑
Theorem: The equation ax+by=d has a solution in integers iff
d=ck3 , ax0+by0=c
d:=gcd(a,b)|c
a(k3x0)+b(k3y0)=ck3
Strategy: If the equation has a solution then c divides the left
side and hence c|d. conversely, let d=ck. If we write ax0+by0=d, by ax1+by1=d;
multiplying both sides by k, we see that the equation has a solution in
integers.
x1=k3x0 ; y1= k3y0, these are the two solutions
Proof: to prove: gcd(a,b)|d ,
Corollary: If a and b are two relatively prime integers, then the
let, c|d ,∀ 𝑐 ∈ 𝕫 equation ax+by=d has an integer solution for all integers d
Exercise: Find the integer solutions of 28x+35y=133
c|a ; c|b

You might also like