Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 2.3.20 (Existence of solutions of $x \equiv a_1 \pmod{m_1}, x \equiv a_2 \pmod {m_2}$.)

Exercise 2.3.20 (Existence of solutions of $x \equiv a_1 \pmod{m_1}, x \equiv a_2 \pmod {m_2}$.)

Let m 1 and m 2 be arbitrary positive integers, and let a 1 and a 2 be arbitrary integers. Show that there is a simultaneous solution of the congruences x a 1 ( mod m 1 ) , x a 2 ( mod m 2 ) , if and only if a 1 a 2 ( mod g ) , where g = ( m 1 , m 2 ) . Show that if this condition is met, then the solution is unique modulo [ m 1 , m 2 ] .

Answers

Proof.

a)
Let S be the system of congruences { x a 1 ( mod m 1 ) , x a 2 ( mod m 2 ) .
(⇒)
If S has a solution x , then g = m 1 m 2 m 1 ,  and  m 1 x a 1 ,

thus g x a 1 .

Similarly, g x a 2 , therefore g ( x a 1 ) ( x a 2 ) = a 2 a 1 , so

a 1 a 2 0 ( mod g ) .

(⇐)
Conversely, suppose that a 1 a 2 0 ( mod g ) . Then there is some integer k such that a 2 a 1 = kg . Since m 1 g m 2 g = 1 , there are integers λ , μ such that λ m 1 g μ m 2 g = k ,

so

λ m 1 μ m 2 = kg = a 2 a 1 .

Therefore a 1 + λ m 1 = a 2 + μ m 2 .

Define x = a 1 + λ m 1 . Then x = a 2 + μ m 2 , so x satisfies

{ x a 1 ( mod m 1 ) , x a 2 ( mod m 2 ) .
b)
Suppose now that the condition a 1 a 2 0 ( mod g ) is met, so that the system S has an integer solution x .

If y is another solution, then

{ x a 1 y ( mod m 1 ) , x a 2 y ( mod m 2 ) .

therefore m 1 y x , m 2 y x . This implies m 1 m 2 y x , thus

x y ( mod m 1 m 2 ) .

Conversely, if x y ( mod m 1 m 2 ) , a fortiori x y ( mod m 1 ) and x y ( mod m 2 ) . Therefore

{ y a 1 ( mod m 1 ) , y a 2 ( mod m 2 ) ,

so y is a solution of S .

To conclude, if x is a solution of S , then the solution of S are

x + k ( m 1 m 2 ) , k .

User profile picture
2024-08-13 09:54
Comments