DISCRETE MATHEMATICS

SOLUTION
EXCERCISE ON PAGE # 284
Q # 1 : Show that 15 is an inverse of 7 modulo 26.
Find gcd(7,26) using Euclidean Algorithm
26 = 7(3) + 5 ----------------->(1)
7 = 5(1) + 2 ------------------->(2)
5 = 2(2) + 1 ------------------->(3)
2 = 1(2)
So gcd( 7,26) = 1 inverse of 7 modulo 26 exists.
Now we write gcd 1 as a linear combination of 7 and 26.
From (3) => 1= 5 – 2(2)
= 5 - [7-5(1)](2) From (2)
= 5 – 2.7 +2. 5
= 3.5 –2.7
= 3.[26 – 7(3)]-2.7 From (1)
= 3.26-9.7-2.7
1 = (3) 26 +(-11)7
So inverse of 7 modulo 26 is 7-1 = -11 in modulo 26 => 7-1 = -11 = -11+26 = 15
CHECK : 7(15) = 105 mod 26 = 1
Q # 2 , 3 , 4 : Do yourself.
Q # 5 : Find an inverse of a modulo m for each of these pairs of relatively prime integers using the
method followed in Example 2.
a) a = 4, m = 9 b) a = 19, m = 141 c) a = 55, m = 89 d) a = 89, m = 232
(a) We need to find inverse of 4 modulo 9
Find gcd(4,9) using Euclidean Algorithm
9 = 4(2) + 1 ---------------->(1)
4 = 1(4)
So gcd ( 4 , 9 ) = 1 inverse of 4 modulo 9 exists.
Now we write gcd 1 as a linear combination of 4 and 9.
From (1) => 1 = 9 - 4(2) =(1)9+(-2)4
So inverse of 4 modulo 9 is 4-1 = -2 in modulo 9 => 4-1 = -2=-2+9 = 7
CHECK : 4(7) =28 mod 9 = 1
(b) and (c) : Do yourself.
(d) We need to find inverse of 89 modulo 232
Find gcd(89,232) using Euclidean Algorithm
232 = 89(2) + 54 ---------------->(1)
89 = 54(1) + 35 ----------------->(2)
54 = 35(1) + 19 ----------------->(3)
35 = 19(1) + 16 ----------------->(4)
19 = 16(1) + 3 ------------------>(5)
16 = 3(5) + 1 -------------------->(6)
3 = 1(3)
So gcd (89,232) = 1 inverse of 89 modulo 232 exists.
Now we write gcd 1 as a linear combination of 89 and 232.
From (6) => 1 = 16 - 3(5)
= 16 – [19 – 16(1)](5) From (5)
1 = 16 – 5.19 +5.16
 1 = 6.16 – 5.19
= 6.[35 – 19(1)]-5.19 = 6.35-6.19 -5.19 From (4)
= 6.35-11.19
= 6.35-11.[54-35(1)] From (3)
= 6.35-11.54+11.35
= 17.35-11.54 = 17.[89-54(1)]-11.54 From (2)
= 17.89-17.54-11.54
= 17.89-28.54
= 17.89-28.[232-89(2)] From (1)
= 17.89-28.232+56.89
= 73.89-28.232
1 = (73)89+(-28)232
So inverse of 89 modulo 232 is 89-1 = 73
CHECK : 89(73) =6497 mod 232 = 1
Q # 6 : Do yourself.
Q # 9 : Solve the congruence 4x ≡ 5 (mod 9) using the inverse of 4 modulo 9 found in part (a) of
Exercise 5.
We ave found above in part(a) of Exercise 5 , inverse of 4 modulo 9 is 7
So 4x ≡ 5 (mod 9)
Multiply both sides by 7
(7)4x ≡ (7)5 (mod 9)
28x ≡ 35 (mod 9)
1.x ≡ 8 (mod 9)
x ≡ 8 (mod 9)
CHECK : 4x ≡ 5 (mod 9) => 4(8) ≡ 5 (mod 9) => 32 ≡ 5 (mod 9) => 5 ≡ 5 (mod 9)
So the congurence is satisfied.
DO YOURSELF :
Q # 10 , 11 , 12