Use the Euclidean algorithm to find the greatest common divisor gcd(a, b) for each pair of integers a, b. Then express the gcd(a, b) of each pair as a linear combination of the integers a, b. (a) gcd(168, 308) (b) gcd(234, 357)
Added by Richard I.
Close
Step 1
a) gcd(168, 308) Show more…
Show all steps
Your feedback will help us improve your experience
Babita Kumari and 98 other Calculus 3 educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Use the Euclidean algorithm to find gcd(1529, 14038), and then express the greatest common divisor of the above pair of integers as a linear combination of these integers.
Madhur L.
For each of the following pairs of integers, use the Extended Euclidean algorithm to find their Greatest Common Divisor (GCD), and to express it as an integer linear combination of the two numbers. (a) 1547, 560. Hint: You can again check your answers on Wolfram Alpha; try "Solve in integers 1547x+560y=z=gcd(1547,560)".
Use the Euclidean algorithm to find a) $\operatorname{gcd}(12,18)$. b) $\operatorname{gcd}(111,201)$. c) gcd(1001, 1331). d) $\operatorname{gcd}(12345,54321)$. e) $\operatorname{gcd}(1000,5040)$ f) $\operatorname{gcd}(9888,6060)$.
Number Theory and Cryptography
Primes and Greatest Common Divisors
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Watch the video solution with this free unlock.
EMAIL
PASSWORD