40. Using the method followed in Example 17, express the greatest common divisor of each of these pairs of inte gers as a linear combination of these integers. a) 9, 11 b) 33, 44 c) 35, 78

Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter10: Sequences, Series, And Probability
Section: Chapter Questions
Problem 59RE
icon
Related questions
icon
Concept explainers
Topic Video
Question

help

40. Using the method followed in Example 17, express the
greatest common divisor of each of these pairs of inte-
gers as a linear combination of these integers.
b) 33, 44
e) 101, 203
h) 3457, 4669
a) 9, 11
d) 21, 55
g) 2002, 2339
c) 35, 78
f) 124, 323
i) 10001, 13422
Transcribed Image Text:40. Using the method followed in Example 17, express the greatest common divisor of each of these pairs of inte- gers as a linear combination of these integers. b) 33, 44 e) 101, 203 h) 3457, 4669 a) 9, 11 d) 21, 55 g) 2002, 2339 c) 35, 78 f) 124, 323 i) 10001, 13422
EXAMPLE 17 Express ged(252, 198) = 18 as a linear combination of 252 and 198 by working backwards
through the steps of the Euclidean algorithm.
Solution: To show that ged(252, 198) = 18, the Euclidean algorithm uses these divisions:
252 = 198 · 1+ 54
198 = 54 · 3 + 36
54 = 36 - 1+ 18
36 = 18 - 2 + 0.
We summarize these steps in tabular form:
252
198
1
54
1
198
54
36
2
54
36
18
3
36
18
2
Using the next-to-last division (the third division), we can express gcd(252, 198) = 18 as a linear
combination of 54 and 36. We find that
18 = 54 – 1. 36.
The second division tells us that
36 = 198 – 3 · 54.
Substituting this expression for 36 into the previous equation, we can express 18 as a linear
combination of 54 and 198. We have
18 = 54 – 1- 36 = 54 – 1 · (198 – 3 - 54) = 4 - 54 – 1· 198.
The first division tells us that
54 = 252 – 1. 198.
Substituting this expression for 54 into the previous equation, we can express 18 as a linear
combination of 252 and 198. We conclude that
18 = 4 - (252 – 1. 198) – 1 - 198 = 4 - 252 – 5 - 198,
completing the solution.
The next example shows how to solve the same problem posed in the previous example
using the extended Euclidean algorithm.
Transcribed Image Text:EXAMPLE 17 Express ged(252, 198) = 18 as a linear combination of 252 and 198 by working backwards through the steps of the Euclidean algorithm. Solution: To show that ged(252, 198) = 18, the Euclidean algorithm uses these divisions: 252 = 198 · 1+ 54 198 = 54 · 3 + 36 54 = 36 - 1+ 18 36 = 18 - 2 + 0. We summarize these steps in tabular form: 252 198 1 54 1 198 54 36 2 54 36 18 3 36 18 2 Using the next-to-last division (the third division), we can express gcd(252, 198) = 18 as a linear combination of 54 and 36. We find that 18 = 54 – 1. 36. The second division tells us that 36 = 198 – 3 · 54. Substituting this expression for 36 into the previous equation, we can express 18 as a linear combination of 54 and 198. We have 18 = 54 – 1- 36 = 54 – 1 · (198 – 3 - 54) = 4 - 54 – 1· 198. The first division tells us that 54 = 252 – 1. 198. Substituting this expression for 54 into the previous equation, we can express 18 as a linear combination of 252 and 198. We conclude that 18 = 4 - (252 – 1. 198) – 1 - 198 = 4 - 252 – 5 - 198, completing the solution. The next example shows how to solve the same problem posed in the previous example using the extended Euclidean algorithm.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Knowledge Booster
Application of Algebra
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, calculus and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning