[ (a/b)*c] mod n=k. If b,c,n,k values are known how can I get back a value provided the range of a,b is -(n-1) to n-1 and c is 0 to n-1 where n is a prime number.?
how to find a solution for this problem.
0
$\begingroup$
modular-arithmetic
-
0Isn't the value you're looking for $\equiv k \bmod n$? – 2017-02-26
-
0not exactly.. i am looking for how modular reduction is performed when a number is multiplied and divided by some digits.. – 2017-02-26
-
0yes b is coprime to n – 2017-02-26
-
0You can compute it as $\,acb^{-1}$ where $b^{-1}$ can be computed efficiently by the Extended Euclidean algorithm (or closely related methods). – 2017-02-26