How can I calculate (x∗k)/i (mod m) where i and m are relatively not co-prime ?
We know that, if gcd(i,m)≠1 , then there doesn't exist a modular multiplicative inverse of i mod m. Then how can it be solved?
Thanks in Advance :)
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