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^{-13} \bmod 2 = ?$
No comments:
Post a Comment