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.
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⋅18≡(−1)(−1)≡1(mod19).
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⋅18≡(−1)(−1)≡1(mod19).
Conditions: Working modulo 19.; Using the fact that 18 ≡ -1 (mod 19).
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.