Hi All,

Having trouble with using Extended Euclid's algorithm to find multiplicative inverses.

I dont understand the algorithm and the more i learn about it the more my brain dies haha.

If someone could answer the following with simple instructions, that would be awesome.

Compute the multiplicative inverse of 9 under modulo 31 using the Extended Euclid's algorithm