2. Compute the ged of the number below using 1) factorization, 2) using Euclid's division algo- rithm: (a) gcd(24, 15) (b) gcd(172, 20) (c) gcd(54, 21) 3. Using the reverse of Euclid's division algorithm compute: (a) Find integers x, y such that 24r + 15y = 3 (b) Find integers x, y such that 172x + 20y = 1000 (c) Find integers x, y such that 23x + 17y = 1 4. Using your work from the earlier parts or independently find: (a) mod 8 (b) + mod 23 (c) mod 7

2. Compute the ged of the number below using 1) factorization, 2) using Euclid's division algo- rithm: (a) gcd(24, 15) (b) gcd(172, 20) (c) gcd(54, 21) 3. Using the reverse of Euclid's division algorithm compute: (a) Find integers x, y such that 24r + 15y = 3 (b) Find integers x, y such that 172x + 20y = 1000 (c) Find integers x, y such that 23x + 17y = 1 4. Using your work from the earlier parts or independently find: (a) mod 8 (b) + mod 23 (c) mod 7

College Algebra

7th Edition

ISBN:9781305115545

Author:James Stewart, Lothar Redlin, Saleem Watson

Publisher:James Stewart, Lothar Redlin, Saleem Watson

Chapter3: Polynomial And Rational Functions

Section: Chapter Questions

Problem 6CC: When we divide a polynomial P(x) by a divisor D(x), the Division Algorithm tells us that we can...

See similar textbooks