# Modular multiplicative inverse

## Concept in modular arithmetic / From Wikipedia, the free encyclopedia

#### Dear Wikiwand AI, let's keep it short by simply answering these key questions:

Can you list the top facts and stats about Modular multiplicative inverse?

Summarize this article for a 10 year old

In mathematics, particularly in the area of arithmetic, a **modular multiplicative inverse** of an integer a is an integer x such that the product ax is congruent to 1 with respect to the modulus m.^{[1]} In the standard notation of modular arithmetic this congruence is written as

- $ax\equiv 1{\pmod {m}},$

which is the shorthand way of writing the statement that m divides (evenly) the quantity *ax* − 1, or, put another way, the remainder after dividing ax by the integer m is 1. If a does have an inverse modulo m, then there are an infinite number of solutions of this congruence, which form a congruence class with respect to this modulus. Furthermore, any integer that is congruent to a (i.e., in a's congruence class) has any element of x's congruence class as a modular multiplicative inverse. Using the notation of ${\overline {w}}$ to indicate the congruence class containing w, this can be expressed by saying that the *modulo multiplicative inverse* of the congruence class ${\overline {a}}$ is the congruence class ${\overline {x}}$ such that:

- ${\overline {a}}\cdot _{m}{\overline {x}}={\overline {1}},$

where the symbol $\cdot _{m}$ denotes the multiplication of equivalence classes modulo m.^{[2]}
Written in this way, the analogy with the usual concept of a multiplicative inverse in the set of rational or real numbers is clearly represented, replacing the numbers by congruence classes and altering the binary operation appropriately.

As with the analogous operation on the real numbers, a fundamental use of this operation is in solving, when possible, linear congruences of the form

- $ax\equiv b{\pmod {m}}.$

Finding modular multiplicative inverses also has practical applications in the field of cryptography, e.g. public-key cryptography and the RSA algorithm.^{[3]}^{[4]}^{[5]} A benefit for the computer implementation of these applications is that there exists a very fast algorithm (the extended Euclidean algorithm) that can be used for the calculation of modular multiplicative inverses.