Q:
# What Is Modular Inverse?

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.

Continue Reading
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.

Learn more about Arithmetic-
Q:
## What Is the Prime Factorization of 48?

A: The prime factorization of 48 is 2 x 2 x 2 x 2 x 3 or 2 to the 4th power x 3. Prime factorization is also called integer factorization, and sometimes prime... Full Answer >Filed Under: -
Q:
## How Do You Find the Factors of 60?

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: -
Q:
## What Is a Positive Integral Factor?

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: -
Q:
## What Is Matrix Division?

A: Matrix division means multiplying one matrix by the inverse of another matrix. Matrix A "divided by" matrix B is equivalent to matrix A multiplied by the i... Full Answer >Filed Under: