Problem 1750. Modular multiplicative inverse

Created by Mehmet OZC

Difficulty:Rate

Solve Later
Add To GroupÃ‚

Modular multiplicative inverse is used for The Chinese Remainder Theorem and RSA algorithm. You can visit Wikipedia.

Normal Modulus

X = M (mod Y)

You can solve that with M = mod(X,Y)

Inverse Modulus

X.B = M (mod Y)

given X,M,Y calculate B

B = inverse_modulus(X,M,Y)

Solve

Solution Stats

86 Solutions
21 Solvers

Last Solution submitted on Sep 05, 2022

Last 200 Solutions

Problem Comments

1 Comment

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 comments

ANNOUNCEMENT

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers21

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 1750. Modular multiplicative inverse

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Problem Recent Solvers21

Suggested Problems

More from this Author92

Problem Tags

Community Treasure Hunt

Problem 1750. Modular multiplicative inverse

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Problem Recent Solvers21

Suggested Problems

More from this Author92

Problem Tags

Community Treasure Hunt

Players