Professional Documents
Culture Documents
Chapter 4b
Chapter 4b
Discrete Mathematics
Number Theory and Cryptography
Discrete Mathematics
Solving Congruences
Discrete Mathematics
Solving Congruences
Solving congruences
Theorem
If a and m are relatively prime integers and m > 1, then an inverse
of a modulo m exists. Further, this inverse is unique modulo m.
(That is, there is a unique positive integer a less than m that is an
inverse of a modulo m and every other inverse of a modulo m is
congruent to a modulo m.)
Discrete Mathematics
Solving Congruences
Discrete Mathematics
Solving Congruences
Discrete Mathematics
Solving Congruences
(mod mk ).
Discrete Mathematics
Solving Congruences
x 3 (mod 5),
x 2 mod 7.
M2 = m/5 = 21,
M3 = m/7 = 15,
Then:
x a1 M1 y1 + a2 M2 y2 + a3 M3 y3
= 2 35 2 + 3 21 1 + 2 15 1 = 233 23 (mod 105).
Prof. Steven Evans
Discrete Mathematics
Solving Congruences
(mod p).
(mod p).
Discrete Mathematics
Solving Congruences
Example
Find 7222 (mod 11).
Discrete Mathematics
Solving Congruences
Example
Find 7222 (mod 11).
By Fermats little theorem, we know that 710 1 (mod 11), so
(710 )k 1 (mod 11) for every positive integer k. Division yields
22 = 22 10 + 2, and hence
7222 = 72210+2 = (710 )22 72 122 49 5
Discrete Mathematics
(mod 11).