Q:

# What is modular inverse?

A:

A modular inverse of a number a(modulo m) is the integer a^-1, such that a * a^-1 is equivalent to 1 (modulo m). Every integer a, except 0, has an inverse (modulo p) where p is a prime number and the integer is not a multiple of p.

## Keep Learning

Credit: ERproductions Ltd Blend Images Getty Images

Using modular arithmetic, the modular inverse of an integer a can be represented as the fraction 1 / a just as it is done in real number arithmetic. The Euclidean algorithm is used to find the solution to an equation, ax + my = 1, if a and m are relatively prime by considering the equation modulo m.

Sources:

## Related Questions

• A: When discussing integers, standard form refers to an integer written as a number, while word form describes an integer written out as a word. Expanded form... Full Answer >
Filed Under:
• A: Find all the factors of 60 by identifying each integer that divides evenly into 60. Begin by finding two factors, such as four and 15. Then find the factor... Full Answer >
Filed Under:
• A: A positive integral factor is the factor of an integer that is both positive and divides evenly into another integer. The definition of the set of integers... Full Answer >
Filed Under:
• A: There are five major properties of addition in math: the commutative property, the associative property, the distributive property, the identity property a... Full Answer >
Filed Under:
PEOPLE SEARCH FOR