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−13mod2=?
How to find limh→0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...
No comments:
Post a Comment