0

https://i.stack.imgur.com/lWwGC.png I tried the question using Euclidean algorithm.

shaylene
  • 37
  • 1
    Please don’t use images. Especially one with so little text. Use MathJax. – Arturo Magidin May 30 '21 at 20:51
  • 1
    $331$ (or $-124$) is the correct answer. Did you use the extended Euclidean algorithm? I suppose you should check the signs in your operations. – Bernard May 30 '21 at 20:53
  • 1
    We have hundreds of answers which explain how to compute modular inverses (and fractions), e.g. see the linked dupes (and their links), which contain most all known methods. Note that $,-124\equiv 331\pmod{!455},$ so $,[-124] = [331],$ in $\Bbb Z/455\ \ $ – Bill Dubuque May 30 '21 at 21:07
  • 1
    dear Amanda, welcome to math.se! :) please do not change what your question is asking after posting it; if you have another question (the one about zero divisors in $\mathbb{Z}\big/455\mathbb{Z}$), please make a separate post about it, rather than altering your original. – Atticus Stonestrom May 30 '21 at 21:34

0 Answers0