The inverse modulus would be to find X such that mod(X,Y) = M where M and Y are known (or X === M (mod Y)); this is the chinese remainder theorem which is generalized for any number of Y's and M's when all have the same X and the GCD of all Y = 1 (greatest common divisor). The author is actually requesting Y*Z + M = X*B, which is not the same thing, or the inverse modulus.
Sorry about that...it was only for learning purposes...
19343 Solvers
708 Solvers
94 Solvers
Back to basics 23 - Triangular matrix
634 Solvers
Are all the three given point in the same line?
270 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!