Cody

Problem 1750. Modular multiplicative inverse

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)

Solution Stats

33.33% Correct | 66.67% Incorrect
Last solution submitted on Apr 20, 2019

Solution Comments

Recent Solvers14

Suggested Problems

More from this Author57