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 and be arbitrary positive integers, and let and be arbitrary integers. Show that there is a simultaneous solution of the congruences , if and only if , where . Show that if this condition is met, then the solution is unique modulo .
Answers
Proof.
- a)
-
Let
be the system of congruences
-
If
has a solution
, then
thus .
Similarly, , therefore , so
-
Conversely, suppose that
. Then there is some integer
such that
. Since
, there are integers
such that
so
Therefore .
Define . Then , so satisfies
- b)
-
Suppose now that the condition
is met, so that the system
has an integer solution
.
If is another solution, then
therefore . This implies , thus
Conversely, if , a fortiori and . Therefore
so is a solution of .
To conclude, if is a solution of , then the solution of are