Modular Division For non co-prime numbers

Question

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 :)

Answer 1

If $i$ and $m$ are not coprime, then $i$ does not have a multiplicative inverse and so, there is no solution to the equation.

If you think about it, it makes sense for there to be no solution because you are essentially trying to multiply by a number that doesn't exist.