Solution Found!
a) How can an inverse of a modulo m be used to solve the
Chapter 5, Problem 12RQ(choose chapter or problem)
QUESTION:
a) How can an inverse of a modulo m be used to solve the congruence ax ? b (mod m) when gcd(a, m) = 1?________________b) Solve the linear congruence 7x = 13 (mod 19).
Questions & Answers
QUESTION:
a) How can an inverse of a modulo m be used to solve the congruence ax ? b (mod m) when gcd(a, m) = 1?________________b) Solve the linear congruence 7x = 13 (mod 19).
ANSWER:Solution In part (a) we have to show that inverse of can be used to solve the congruence In part (b) we solve the linear congruence Step 1 Part (a) Let be the inverse of So, Since greatest common divisor It means inverse do exist Now it is given that Multiplying both sides by , we get => (since =).