With the Extended Euclidean algorithm, we finally have an efficient algorithm for finding the modular inverse. Figure out whether there are the inverses of the following x modulo m. If yes, please use EEA to calculate it. If not, please explain why. 

(a) x = 13, m = 120
(b) x = 9, m = 46

Answer rating: 100% (QA)

To find the modular inverses of xx modulo mm using the Extended Euclidean Algorithm EEA we need to s... View the full answer