Wednesday, 1 July 2015

modular arithmetic - How to solve inverse modulo?

Inverse modulo can be solved easily by Euclidean algorithm but 3 to the power minus 13 mod 2 can not be easy, I appreciate if anybody can give a solution.



For example: 3−13mod

-

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

real analysis - How to find lim_{hrightarrow 0}frac{sin(ha)}{h}

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