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...
High school cafeteria
Sum all integers from 1 to 2^n
Project Euler: Problem 3, Largest prime factor
Is the Point in a Circle?
sum of non-primes
Happy Free Wednesday!
Lunar Arithmetic (Addition)
Dealing with correlation results!
Pi Digit Probability
List all of the integer points in a bounded feasble region
Find the treasures in MATLAB Central and discover how the community can help you!
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office