a) How can an inverse of a modulo m be used to solve the

Chapter 5, Problem 12RQ

(choose chapter or problem)

Get Unlimited 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).

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 =).

Add to cart


Study Tools You Might Need

Not The Solution You Need? Search for Your Answer Here:

×

Login

Login or Sign up for access to all of our study tools and educational content!

Forgot password?
Register Now

×

Register

Sign up for access to all content on our site!

Or login if you already have an account

×

Reset password

If you have an active account we’ll send you an e-mail for password recovery

Or login if you have your password back