Problem 1750. Modular multiplicative inverse
30.23% Correct | 69.77% Incorrect
Last Solution submitted on Sep 05, 2022
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.
Problem Recent Solvers21
Find common elements in matrix rows
Who is the smartest MATLAB programmer?
More from this Author92
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!