Question

Required Information Ch 04 Sec 4 EX OG MAIN - Inverse of a modulo m using the Euclidean Algorithm NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Arrange the steps to find an inverse of a modulo m for each of the following pairs of relatively prime integers using the Euclidean algorithm in the order Ch 04 Sec 4 Ex 06 (d) - Inverse of a modulo m using the Euclidean Algorithm 0-200, m-1001 Rank the options below By using the Euclidean algorithm, 1001 - 5200+ 1. ► Let 200s +1001-1, where sis an inverse of 200 modulo 1001 4 The gcd in terms of 1001 and 200 is written as 1 - 1001 - 5200 - $-5, so an inverse of 200 modulo 1001 is -5.

Answer 1

soin a= roo m-1001 We have By usi 3:5X200+ using the Eclidean algorithms 1001 The ged in team of lool of 200 westen as 200 costen as 1 - 1001-5* 20- let 2oost lool t = 1 alheresis invease of 200 mod 1001 - s=-5 So, an inveese of 200 mod lool is -5