Scribd
Upload
105 views

Lesson1 3-EuclideanAlgorithm&DiophantineEquation

This document discusses number theory concepts including the Euclidean algorithm, greatest common divisors (GCDs), least common multiples (LCMs), and Diophantine equations. It provides definitions, theorems, and properties related to these topics. For example, it states that the Euclidean algorithm can be used to find the GCD of two integers and that a linear Diophantine equation has a solution if and only if the GCD of the coefficients divides the constant term. It also includes example problems applying these concepts.

Uploaded by

Ely Balaquiao IV
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
105 views

Lesson1 3-EuclideanAlgorithm&DiophantineEquation

This document discusses number theory concepts including the Euclidean algorithm, greatest common divisors (GCDs), least common multiples (LCMs), and Diophantine equations. It provides definitions, theorems, and properties related to these topics. For example, it states that the Euclidean algorithm can be used to find the GCD of two integers and that a linear Diophantine equation has a solution if and only if the GCD of the coefficients divides the constant term. It also includes example problems applying these concepts.

Uploaded by

Ely Balaquiao IV
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 24

NUMBER THEORY

LESSON 1.3: The Euclidean Algorithm and Diophantine Equation


The Euclidean Algorithm
The Euclidean Algorithm
Lemma
If a = qb + r , then gcd(a, b) = gcd(b, r ).

Theorem
If k > 0, then gcd(ka, kb) = kgcd(a, b).

Corollary
For any integer k ”= 0, gcd(ka, kb) = |k|gcd(a, b).
The Euclidean Algorithm
The Euclidean Algorithm
The Euclidean Algorithm
The Euclidean Algorithm
Definition
The least common multiple of two nonzero integers a and b, denoted
by lcm(a, b), is the positive integer m satisfying the following:
a. a|m and b|m.
b. If a|c and b|c, with c > 0, then m Æ c.
The Euclidean Algorithm
The Euclidean Algorithm
Theorem
For positive integers a and b,

gcd(a, b) · lcm(a, b) = ab.

Corollary
For any choice of positive integers a and b, lcm(a, b) = ab if and
only if gcd(a, b) = 1.
The Euclidean Algorithm
The Diophantine Equation ax + by = c
The Diophantine Equation
Theorem
The linear Diophantine equation ax + by = c has a solution if and
only if d|c, where d = gcd(a, b). If x0 , y0 is any particular solution of
this equation, then all other solutions are given by
3 4 3 4
b a
x = x0 + t y = y0 ≠ t
d d
where t is an arbitrary integer.

Divisibility Theory in the Integers khikz delloro 13


The Diophantine Equation ax + by = c
The Diophantine Equation

Corollary
If gcd(a, b) = 1 and if x0 , y0 is a particular solution of the linear
Diophantine equation ax + by = c, then all solutions are given by

x = x0 + bt y = y0 ≠ at

for integral values of t.


The Diophantine Equation
The Diophantine Equation
The Diophantine Equation
The Diophantine Equation
The Diophantine Equation
The Diophantine Equation
The Diophantine Equation
TRY THESE:
Try these:
1. Use the Euclidean Algorithm to obtain integers x and y
satisfying: gcd 56,72 = 56𝑥 + 72𝑦
2. Find 𝑙𝑐𝑚 143,227
3. Determine all solutions in the integers of the Diophantine
equation 56𝑥 + 72𝑦 = 40.
4. A certain number of sixes and nines is added to give a sum of
126; if the number of sixes and nines is interchanged, the
new sum is 114. How many of each were there originally?
TRY THESE:
TRY THESE:
TRY THESE:
TRY THESE:
TRY THESE:
TRY THESE:
TRY THESE:

You might also like