Saturday, 3 December 2016

Modular Division For non co-prime numbers

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)\neq1$ , then there doesn't exist a modular multiplicative inverse of $i$ mod $m$. Then how can it be solved?




Thanks in Advance :)

No comments:

Post a Comment

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}...