Scribd
Upload
29 views16 pages

Lecture 5

The document discusses the Euclidean algorithm and extended Euclidean algorithm. The Euclidean algorithm is used to find the greatest common divisor (GCD) of two integers by repeatedly finding the remainder of dividing the larger number by the smaller number. The extended Euclidean algorithm allows one to compute integers x and y such that ax + by = GCD(a,b). An example is shown finding the GCD of 270 and 192 using the Euclidean algorithm and computing x and y such that 1914x + 899y = GCD(1914,899) with the extended Euclidean algorithm.

Uploaded by

joelanandraj
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
29 views16 pages

Lecture 5

The document discusses the Euclidean algorithm and extended Euclidean algorithm. The Euclidean algorithm is used to find the greatest common divisor (GCD) of two integers by repeatedly finding the remainder of dividing the larger number by the smaller number. The extended Euclidean algorithm allows one to compute integers x and y such that ax + by = GCD(a,b). An example is shown finding the GCD of 270 and 192 using the Euclidean algorithm and computing x and y such that 1914x + 899y = GCD(1914,899) with the extended Euclidean algorithm.

Uploaded by

joelanandraj
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/ 16

Lecture 5

Euclidean Algorithm and Extended


Euclidean Algorithm
Introduction:

 The Euclidean Algorithm is a technique for quickly


finding the GCD of two integers.

 The Greatest Common Divisor (GCD) of two integers A and


B is the largest integer that divides both A and B.
The Euclidean Algorithm for finding GCD(A,B) is as follows:

 If A = 0 then GCD(A,B)=B, since the GCD(0,B)=B, and we can


stop.
 If B = 0 then GCD(A,B)=A, since the GCD(A,0)=A, and we can
stop.
 Write A in quotient remainder form (A = B⋅Q + R)
 Find GCD(B,R) using the Euclidean Algorithm since GCD(A,B) =
GCD(B,R)
Example:
Find the GCD of 270 and 192.
Step 1:
 A=270, B=192A ≠0B ≠0
 Use long division to find that 270/192 = 1 with a remainder
of 78.
 We can write this as: 270 = 192 * 1 +78
 Find GCD(192,78), since GCD(270,192)=GCD(192,78)
Step 2:

 A=192, B=78
 A ≠0B ≠0
 Use long division to find that 192/78 = 2 with a remainder
of 36.
 We can write this as:192 = 78 * 2 + 36
 Find GCD(78,36), since GCD(192,78)=GCD(78,36)
Step 3

 A=78, B=36
 A ≠0
 B ≠0
 Use long division to find that 78/36 = 2 with a remainder of 6.
 We can write this as:
78 = 36 * 2 + 6
 Find GCD(36,6), since GCD(78,36)=GCD(36,6)
Step 4

 A=36, B=6
 A ≠0
 B ≠0
 Use long division to find that 36/6 = 6 with a remainder of 0.
 We can write this as:
36 = 6 * 6 + 0
 Find GCD(6,0), since GCD(36,6)=GCD(6,0)
Step 6

 A=6, B=0
 A ≠0
 B =0, GCD(6,0)=6

So we have shown:

 GCD(270,192) = GCD(192,78) = GCD(78,36) = GCD(36,6) =


GCD(6,0) = 6
GCD(270,192) = 6
EXTENDED EUCLIDEAN ALGORITHM
 The extended Euclidean algorithm is an algorithm to compute
integers x and y such that ax + by= gcd (a , b) given a and b.

 The extended Euclidean algorithm can be viewed as the reciprocal


of modular exponentiation.

 By reversing the steps in the Euclidean algorithm, it is possible to


find these integers x and y.
 We start with our GCD of 102 and 38: We rewrite it in terms of
the previous two terms:
2 =26 – 2 * 12.
 We replace for 12 by taking our previous line 38 =1x26 +12.
2 = 26 - 2 x (38 - 1 * 26).
 Collect like terms, the 26's, and we have,
2= 3 (26) – 2 (38).
 Repeat the process,
2=3(102-2 * 38) – 2 (38).
 The final result is our answer:

2= 3 * 102 - 8 * 38

 Thus x and y are 3 and 38.


Assignment
Find two integers x and y such that 1914a+899b=gcd(1914,899)
Thank You…

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy