Problem 1750. Modular multiplicative inverse
Solution Stats
Problem Comments
-
1 Comment
Rafael S.T. Vieira
on 12 Oct 2020
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.
Solution Comments
-
1 Comment
Claudio Gelmi
on 27 Jul 2013
Sorry about that...it was only for learning purposes...
Problem Recent Solvers21
Suggested Problems
-
Find common elements in matrix rows
2114 Solvers
-
374 Solvers
-
442 Solvers
-
Who is the smartest MATLAB programmer?
701 Solvers
-
596 Solvers
More from this Author92
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!