Scribd
Upload
83 views15 pages

Lecture 39 (GCD)

The document discusses the Euclidean algorithm and optimization problems. It provides examples of using the Euclidean algorithm to calculate the greatest common divisor (GCD) of two integers. It explains that the Euclidean algorithm works because the GCD is not changed from line to line. It then defines an optimization problem as finding the best solution from all feasible solutions, and notes optimization problems can have continuous or discrete variables, with discrete variable problems known as combinatorial optimization problems.

Uploaded by

avinash
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
83 views15 pages

Lecture 39 (GCD)

The document discusses the Euclidean algorithm and optimization problems. It provides examples of using the Euclidean algorithm to calculate the greatest common divisor (GCD) of two integers. It explains that the Euclidean algorithm works because the GCD is not changed from line to line. It then defines an optimization problem as finding the best solution from all feasible solutions, and notes optimization problems can have continuous or discrete variables, with discrete variable problems known as combinatorial optimization problems.

Uploaded by

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

CSE408

GCD and
Optimization Problem

Lecture # 39
Euclidean Algorithm

m,n Euclidean
gcd(m,n)
Algorithm
integer euclid(pos. integer m, pos. integer n)
x = m, y = n
while(y > 0)
r = x mod y
x=y
y=r
return x

L11 2
Euclidean Algorithm. Example

gcd(33,77):
Step r = x mod y x y

0 - 33 77

L11 3
Euclidean Algorithm. Example

gcd(33,77):
Step r = x mod y x y

0 - 33 77
33 mod 77
1 77 33
= 33

L11 4
Euclidean Algorithm. Example

gcd(33,77):
Step r = x mod y x y

0 - 33 77
33 mod 77
1 77 33
= 33
77 mod 33
2 33 11
= 11

L11 5
Euclidean Algorithm. Example

gcd(33,77):
Step r = x mod y x y

0 - 33 77
33 mod 77
1 77 33
= 33
77 mod 33
2 33 11
= 11
33 mod 11
3 11 0
L11 =0 6
Euclidean Algorithm. Example

gcd(244,117):
Step r = x mod y x y
0 - 244 117

L11 7
Euclidean Algorithm. Example

gcd(244,117):
Step r = x mod y x y
0 - 244 117
1 244 mod 117 = 10 117 10

L11 8
Euclidean Algorithm. Example

gcd(244,117):
Step r = x mod y x y
0 - 244 117
1 244 mod 117 = 10 117 10
2 117 mod 10 = 7 10 7

L11 9
Euclidean Algorithm. Example

gcd(244,117):
Step r = x mod y x y
0 - 244 117
1 244 mod 117 = 10 117 10
2 117 mod 10 = 7 10 7
3 10 mod 7 = 3 7 3

L11 10
Euclidean Algorithm. Example

gcd(244,117):
Step r = x mod y x y
0 - 244 117
1 244 mod 117 = 10 117 10
2 117 mod 10 = 7 10 7
3 10 mod 7 = 3 7 3
4 7 mod 3 = 1 3 1

L11 11
Euclidean Algorithm. Example

gcd(244,117):

Step r = x mod y x y
0 - 244 117
1 244 mod 117 = 10 117 10
2 117 mod 10 = 7 10 7
3 10 mod 7 = 3 7 3
4 7 mod 3 = 1 3 1
5 3 mod 1=0 1 0
By
L11
definition  244 and 117 are rel. prime.
12
Euclidean Algorithm Correctness

The reason that Euclidean algorithm works is


gcd(x,y ) is not changed from line to line. If x’,
y’ denote the next values of x , y then:
gcd(x’,y’) = gcd(y, x mod y)
= gcd(y, x + qy) (the useful fact)
= gcd(y, x ) (subtract y -multiple)
= gcd(x,y)

L11 13
Optimization Problem

• In mathematics and computer science, an optimization


problem is the problem of finding the best solution
from all feasible solutions. Optimization problems can
be divided into two categories depending on whether
the variables are continuous or discrete.
• An optimization problem with discrete variables is
known as a combinatorial optimization problem. In a
combinatorial optimization problem, we are looking for
an object such as an integer, permutation or graph
from a finite (or possibly countable infinite) set.

You might also like