LINEAR

DIOPHANTINE
SUBJECT CODE: 191MAB403T
SUBJECT NAME: PROBABILITY AND NUMBER THEORY
EQUATION AND
HOW ITS SOLVED
SIVA SHANKAR.M 310622104142
RAMSUNDAR.M 310622104119
SIVA SURYA.V.S 310622104140
SARATHI 310622104131
SHREYA.B 310622104137
SANDHIYA.T 310622104124
DATE : 26-03-2024
CONTENTS:
 Introduction
 Difference between linear and non-
linear Diophantine equation
 What is linear Diophantine equation
 Euler’s method for solving linear
Diophantine equation
 Application of Diophantine
equation
 Conclusion
 INTRODUCTION:

 A Diophantine equation is an equation of the form ax + by = c, where a, b, and c are

integers, and x and y are unknown integers to be solved for.
 Euler's method for solving Diophantine equations involves finding a particular
solution and then using it to generate all other solutions.
 This method often involves using properties of modular arithmetic and the
Euclidean algorithm to find solutions efficiently.
 DIFFERENCE BETWEEN LINEAR AND NON LINEAR
EQUATION
LINEAR EQUATION
 Linear Diophantine equations are of the
form ax + by = c, where a, b, and c are
integers, and x and y are unknown integers
to be solved for.
 Solutions to linear Diophantine equations
form a straight line when plotted on a graph.
 Techniques such as the Euclidean algorithm
and modular arithmetic are commonly used
to solve linear Diophantine equations
efficiently.
NON LINEAR EQUATION
 Nonlinear Diophantine equations involve
higher powers or products of variables,
making them more complex than linear
equations.
 They can take various forms, such as ax^2 +
by^2 = c or xy = z, where a, b, and c are
integers.
 Solutions to nonlinear Diophantine equations
may not follow a predictable pattern, and
finding solutions can be more challenging.
 LINEAR DIOPHANTINE EQUATION

THEOREM:
The Linear Diophantine equations of the type ax + by = c -----(1),has the solution if and
only if the GCD(a,b)|c. The integer pair (x,y) which satisfies the above equation is called its
solution. It is also called a Lattice Point. If (x0,y0) is one solution of the equation(1) then there are
infinite of them and the general solution(x,y) is given by,

where GCD(a,b) and t=0, ±1, ±2….

EUCLIDEAN’S
METHOD FOR
DIOPHANTINE
EQUATION
 Solve the Diophatine equation 7x + 18y = 208 if the
solution exists.
Solution:
The GCD(7,18) =1 and 1 is divided by 208, so the
solution exists. To find the solution we use Euclidean

EXAMPLE 1: 18 = (7×2) + 4
7 = (4×1) + 3
4 = (3×1) + 1
3 = (3×1) + 0
We can see that GCD(7,18) = 1
We will now go backwards and use the theorem that for Linear Diophantine Equation
ax + by = c, we can always find integers x and y such that ax + by = GCD(a,b)
From the second last equation,
1 = 4 – (3×1)
= 4 –(7 – 4 ×1)
= (4 × 2) – 7
= (18–7× 2) × 2 – 7
= 18 × 2 – 7 × 5
Or 7(-5) + 18(2) =1………(1)
We have been able to find the integers –5 and 2 such that the linear combination of 7 and
18 is equal to the GCD(7,18).
The given equation, 7x + 18y = 208
If we multiply equation(1) by 208 all over we will get,
7(–5×208) + 18(2×208) = 208
7(–1040) + 18(416) = 208
Here (x0,y0) = (–1040,416) and the general solution(x,y) is given by,
x = –1040 + t = –1040 + 18t
y = 416 – t = 416 – 7t
Where t = 0,±1,±2,…
 Solve 45x + 33y = 9.
Using Euclidean Algorithm,
45 = 33(1) + 12
33 = 12(2) + 9
EXAMPLE 2: 12 = 9(1) + 3
9 = 3(3) + 0
GCD(45,33) = 3
3 divides 9
The given equation has Many Solutions.
3 = 12 – 9
3 = 12 – [ 33 – 12(2) ]
= 12 – 33 + 12(2)
3 = 12(3) – 33
3 = (45 – 33 )(3) – 33
=45(3) – 33(3) – 33
3 = 45(3) + 33 (–4)
c = ax + by
Therefore , x = 3 and y = –4
EXAMPLE 3: EXAMPLE 4:

Solve 6x + 9y = 113. Solve 10x + 15y = 33.

Using Euclidean Algorithm, Using Euclidean Algorithm,
a=6 b=9 c=113 a=10 b=15 c=33
9 = 6(1) + 3 15 = 10(1) + 5
6 = 3(2) + 0 10 = 5(2) + 0
GCD(6,9) = 3 GCD(10,15) = 5
But 3 does not divide 113, 5 does not divide 33,
Therefore, the equation has no solution. Therefore, the equation has no solution.
 Euler’s method

GCD of 2076 and 1076

2076 = 1076*1 + 1000
SOLVE : 1076x+2076y = 3076 1076 = 1000*1 + 76
1000 = 76*13 + 12
76 = 12*6 + 4
12 = 4*3 + 0
 APPLICATIONS:
Diophantine Equations have applications in various
field including,
 Number theory
 Cryptography
 Integer Programming
 Physics and Engineering
Overall,Diophantine equations have broader
applications across various discipline.
CONCLUSION:
 In conclusion, Diophantine equations
represent a fascinating area of
mathematics with diverse
applications across numerous fields.
 Their study not only enriches our
understanding of number theory but
also contributes to the development
of practical solutions in cryptography,
optimization, physics, and
engineering.
vv