# a) Show that the system of congruences.x: a2(modm1) and x ## Problem 38E Chapter 4.SE

Discrete Mathematics and Its Applications | 7th Edition

• 2901 Step-by-step solutions solved by professors and subject experts
• Get 24/7 help from StudySoup virtual teaching assistants Discrete Mathematics and Its Applications | 7th Edition

4 5 0 366 Reviews
14
4
Problem 38E

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

Step-by-Step Solution:

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 Step 2:(a)The system of congruences has solution iff such that Rearranging we get Since is linear combination of and .any integer which is linear combination of and will be multiple of gcd(,) and hence gcd(,must divides .Now consider gcd(, divides that is let By extension of Euclid’s algorithm there exists p and q such that Hence and is solution for and hence is solution to the system.

Step 3 of 3

#### Related chapters

Unlock Textbook Solution

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

×
Get Full Access to Discrete Mathematics And Its Applications - 7th Edition - Chapter 4.se - Problem 38e

Get Full Access to Discrete Mathematics And Its Applications - 7th Edition - Chapter 4.se - Problem 38e

I don't want to reset my password

Need help? Contact support

Need an Account? Is not associated with an account
We're here to help