a) Show that the system of congruences.x: a2(modm1) and x

Chapter 5, Problem 38E

(choose chapter or problem)

Get Unlimited Answers
QUESTION:

a) Show that the system of congruences.x: ? a2(modm1) and x ? a2 (mod m2), where a1, a2. m1, and m2 are integers with m1 >0 and m2 > 0, has a solution if and only if gcd(m1, m2) | a1 – a2.________________b) Show that if the system in part (a) has a solution, then it is unique modulo 1cm(m1, m2).

Questions & Answers

QUESTION:

a) Show that the system of congruences.x: ? a2(modm1) and x ? a2 (mod m2), where a1, a2. m1, and m2 are integers with m1 >0 and m2 > 0, has a solution if and only if gcd(m1, m2) | a1 – a2.________________b) Show that if the system in part (a) has a solution, then it is unique modulo 1cm(m1, m2).

ANSWER:

Solution Step 1:In part (a) we have to show that system of congruences and Where are integers with and ,has a solution if and only if

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