Question

7. (1) Use the extended Euclidean algorithm to compute the multiplicative inverses: a. 17?¹ mod 101 b. 357?¹ mod 1234 (2) Compute gcd (57, 93), and find integers s and t such that 57s+93t= gcd (57, 93). (c) Compute Euler's totient functions: ?(41), ?(27), and ?(440).

          7. (1) Use the extended Euclidean algorithm to compute the multiplicative
inverses:
a. 17?¹ mod 101
b. 357?¹ mod 1234
(2) Compute gcd (57, 93), and find integers s and t such that 57s+93t= gcd (57,
93).
(c) Compute Euler's totient functions: ?(41), ?(27), and ?(440).

7. (1) Use the extended Euclidean algorithm to compute the multiplicative
inverses:
a. 17?¹ mod 101
b. 357?¹ mod 1234
(2) Compute gcd (57, 93), and find integers s and t such that 57s+93t= gcd (57,
93).
(c) Compute Euler's totient functions: ?(41), ?(27), and ?(440).

Added by Amparo F.

Calculus: Early Transcendentals

James Stewart 8th Edition

Instant Answer

Solved by Expert Drew Scalzo

Step 1

To compute the multiplicative inverse of 17 mod 101, we use the extended Euclidean algorithm. We start with the equation 101 = 17*5 + 16. Then we have 17 = 16*1 + 1. So, we can write 1 = 17 - 16 = 17 - (101 - 17*5) = 17*6 - 101. Show more…

Show all steps

Thanks for your feedback!

Use the extended Euclidean algorithm to compute the multiplicative inverses: 17^-1 mod 101, b. 357^-1 mod 1234. Compute gcd(57, 93), and find integers s and t such that 57s + 93t = gcd(57, 93). Compute Euler's totient functions: φ(41), φ(27), and φ(440).