Show that the system of congruences

x== a1 mod(m1)

x== a2 mod(m2)

has a solution if and only if

gcd(m1,m2) | (a1-a2)

Printable View

- October 28th 2008, 07:32 PMjustin6mathhelpSystem of Congruences
Show that the system of congruences

x== a1 mod(m1)

x== a2 mod(m2)

has a solution if and only if

gcd(m1,m2) | (a1-a2) - October 29th 2008, 11:00 PMHallsofIvy