Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 4 - Section 4.3 - Primes and Greatest Common Divisors - Exercises - Page 273: 44

Answer

Gcd can be solve by using extended euclidean algorithm In order to find s Sj=Sj-2 -Sj-1*qj-1 Tj=tj-2-tj-1*qj-1

Work Step by Step

Gcd can be solve by using extended euclidean algorithm In order to find s Sj=Sj-2 -Sj-1*qj-1 Tj=tj-2-tj-1*qj-1
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.