Tool to compute the modular inverse of a number. The modular multiplicative inverse of an integer N modulo m is an integer n such as the inverse of N modulo m equals n.

dCode is free and its tools are a valuable help in games, puzzles and problems to solve every day! You have a problem, an idea for a project, a specific need and dCode can not (yet) help you? You need custom development? Contact-me!

This page is using the new English version of dCode, please make comments !

Tool to compute the modular inverse of a number. The modular multiplicative inverse of an integer N modulo m is an integer n such as the inverse of N modulo m equals n.

Answers to Questions

What is the modular Inverse?

The value of the inverse modular of \( a \) by the modulus \( n \) is the value \( u \) such as $$ u \equiv a^{-1} \pmod n \\ a u \equiv 1 \pmod n $$

How to calculate a modular inverse?

To calculate the value of the modular inverse, you can use the extended euclide algorithm which find solutions to the identity of Bezout \( au + bv = \text{G.C.D.}(a, b) \) except that here \( \text{G.C.D.}(a, b) = 1 \) and you only look for \( u \).

The keyword invmod is the abbreviation of inverse modular.

Ask a new question

Source code

dCode retains ownership of the source code of the script Modular Multiplicative Inverse. Except explicit open source licence (free / freeware), any algorithm, applet, software (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, translator), or any snippet or function (convert, solve, decrypt, encrypt, decipher, cipher, decode, code, translate) written in PHP (or Java, C#, Python, Javascript, etc.) which dCode owns rights can be transferred after sales quote. So if you need to download the Modular Multiplicative Inverse script for offline use, for you, your company or association, see you on contact page !

dCode uses cookies to customize the site content, analyze user behavior and adapt dCode to your use. Some data is stored and collected for advertising purposes and may be shared with our partners. OK