Friday, 16 October 2015

modular arithmetic - Finding Multiplicative Inverse



I'm told to find the multiplicative inverse of 9mod37.



I can't really use the the Euclidean Algorithm on the equation 9=Q37+R where the LHS is already smaller than the RHS or am I wrong in thinking this way?


Answer




Hint, easy to observe 9(4)=36=1(mod37). On your other point, Euclidean algorithm works fine.


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...