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
Show commentsProblem Recent Solvers21
Suggested Problems
-
2305 Solvers
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
1445 Solvers
-
11385 Solvers
-
Sort numbers by outside digits
142 Solvers
-
convert matrix to single column
380 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!