What would you like to understand?

The inverse of 17 modulo 19 is 9. It is computed quickly by rewriting 17 as -2 modulo 19.

Conditions: Modulus is 19.; Residue $a = 17$.

The inverse of 17 modulo 19 is 9. It is computed quickly by rewriting 17 as -2 modulo 19.

Conditions: Modulus is 19.; Residue $a = 17$.

18 is its own inverse modulo 19 because 18 is congruent to -1 modulo 19, and -1 is always its own multiplicative inverse since $(-1)(-1)=1$. Therefore, $18 \cdot 18 \equiv (-1)(-1) \equiv 1 \pmod{19}$.

Conditions: Working modulo 19.; Using the fact that 18 ≡ -1 (mod 19).

18 is its own inverse modulo 19 because 18 is congruent to -1 modulo 19, and -1 is always its own multiplicative inverse since $(-1)(-1)=1$. Therefore, $18 \cdot 18 \equiv (-1)(-1) \equiv 1 \pmod{19}$.

Conditions: Working modulo 19.; Using the fact that 18 ≡ -1 (mod 19).

Negative residues make finding modular inverses easier by replacing a large positive representative with a smaller-magnitude equivalent residue modulo m. This often turns the problem into finding the inverse of a simpler number, like -1 or -2, which can be recognized immediately or factored more easily.

Conditions: The replacement must be congruent modulo the same m.; The resulting residue should still be invertible modulo m.

Negative residues make finding modular inverses easier by replacing a large positive representative with a smaller-magnitude equivalent residue modulo m. This often turns the problem into finding the inverse of a simpler number, like -1 or -2, which can be recognized immediately or factored more easily.

Conditions: The replacement must be congruent modulo the same m.; The resulting residue should still be invertible modulo m.