Hi,

im having some difficulties when trying to calculate the modulo inverse.

for example:

X = 12 mod 31

X = 20 mod 41 (I don't know how to write that in LaTex =/)

So we need to find u and v such that 31u + 41v = 1

They're both co-prime. My problem is that i don't understand how to run the Euclid's algorithm "backwards"

/Best regards Jones