On the following page at the bottom there is an algorithm for calculating modular inverses. In the proof I am confused with the line 'Taking both sides modulo $m$'. How does that work getting a congruence from the above equation?
On the following page at the bottom there is an algorithm for calculating modular inverses. In the proof I am confused with the line 'Taking both sides modulo $m$'. How does that work getting a congruence from the above equation?
No comments:
Post a Comment