What would you like to understand?

The inverse of 5 modulo 7 is 3. It is computed using the add-the-modulus method: start with 1, add 7 to get 8 (not a multiple of 5), add 7 again to get 15.

Conditions: Modulus is 7.; Target integer is 5.

The inverse of 5 modulo 7 is 3. It is computed using the add-the-modulus method: start with 1, add 7 to get 8 (not a multiple of 5), add 7 again to get 15.

Conditions: Modulus is 7.; Target integer is 5.

To find the inverse of a modulo m by hand, start with 1 and repeatedly add the modulus m to generate numbers congruent to 1 modulo m. Stop when you reach a number that is a multiple of a.

Conditions: Used to find an inverse of a modulo m.; One looks among integers congruent to 1 modulo m for a multiple of a.

To find the inverse of a modulo m by hand, start with 1 and repeatedly add the modulus m to generate numbers congruent to 1 modulo m. Stop when you reach a number that is a multiple of a.

Conditions: Used to find an inverse of a modulo m.; One looks among integers congruent to 1 modulo m for a multiple of a.