Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 2.3.24* (Complete system of residues modulo $m_1m_2\cdots m_r$.)

Exercise 2.3.24* (Complete system of residues modulo $m_1m_2\cdots m_r$.)

Suppose that m 1 , m 2 , , m r are pairwise relatively prime positive integers. For each j , let 𝒞 ( m j ) denote a complete system of residues modulo m j . Show that the numbers c 1 + c 2 m 1 , + c 3 m 1 m 2 + + c r m 1 m 2 m r 1 , c j 𝒞 ( m j ) , form a complete system of residues modulo m = m 1 m 2 m r .

Answers

Proof. Consider the map

φ { 𝒞 ( m 1 ) × × 𝒞 ( m r ) mℤ ( c 1 , , c r ) [ c 1 + c 2 m 1 + c 3 m 1 m 2 + + c r m 1 m 2 m r 1 ] m

We show first that φ is injective(one-to-one).

Suppose that φ ( c 1 , , c r ) = φ ( d 1 , , d r ) , where ( c 1 , , c r ) , ( d 1 , , d r ) are in 𝒞 ( m 1 ) × × 𝒞 ( m r ) . Then

c 1 + c 2 m 1 + c 3 m 1 m 2 + + c r m 1 m 2 m r 1 d 1 + d 2 m 1 + d 3 m 1 m 2 + + d r m 1 m 2 m r 1 ( mod m ) .

If we write e i = c i d i for i = 1 , , r , we obtain

e 1 + e 2 m 1 + e 3 m 1 m 2 + + e r m 1 m 2 m r 1 0 ( mod m 1 m r ) ,

so

e 1 + e 2 m 1 + e 3 m 1 m 2 + + e r m 1 m 2 m r 1 = λ m 1 m r

for some integer λ . It remains to prove by induction that e i = 0 for i = 1 , , r .

  • First m 1 λ m 1 m r ( e 2 m 1 + e 3 m 1 m 2 + + e r m 1 m 2 m r 1 ) = e 1 , thus m 1 e 1 = c 1 d 1 , so

    c 1 d 1 ( mod m 1 ) .

    Moreover c 1 , d 1 are elements of the same complete system 𝒞 ( m 1 ) of residues modulo m 1 , and are congruent modulo m 1 , therefore c 1 = d 1 , so e 1 = 0 .

  • Suppose now that e 1 = e 2 = = e k = 0 , where k < r . Then

    e k + 1 m 1 m 2 m k + + e r m 1 m 2 m r = λ m 1 m 2 m r .

    Simplifying by m 1 m 2 m k , we obtain

    e k + 1 + e k + 2 m k + 1 + + e r m k + 1 m r 1 = λ m k + 1 m r .

    Then m k + 1 λ m k + 1 m r ( e k + 2 m k + 1 + + e r m k + 1 m r 1 ) = e k + 1 , thus m k + 1 e k + 1 = c k + 1 d k + 1 , so

    c k + 1 d k + 1 ( mod m k + 1 ) .

    Moreover c k + 1 , d k + 1 are elements of the same complete system 𝒞 ( m k + 1 ) of residues modulo m k + 1 , and are congruent modulo m k + 1 , therefore c k + 1 = d k + 1 , so e k + 1 = 0 .

  • We can conclude this induction: e 1 = e 2 = = e r = 0 thus ( c 1 , , c r ) = ( d 1 , , d r ) . This proves that φ is injective.

Then φ : 𝒞 ( m 1 ) × × 𝒞 ( m r ) mℤ is injective, and

| 𝒞 ( m 1 ) × × 𝒞 ( m r ) | = m 1 m 2 m r = | mℤ | .

This proves that φ is also surjective (onto), thus φ is a bijection.

Write 𝒞 for the set of numbers c 1 + c 2 m 1 , + c 3 m 1 m 2 + + c r m 1 m 2 m r 1 , where c j 𝒞 ( m j ) for j = 1 , , r .

Since, φ is bijective, for any integer n , there is a unique element c = c 1 + c 2 m 1 , + c 3 m 1 m 2 + + c r m 1 m 2 m r 1 𝒞 such that

c 1 + c 2 m 1 , + c 3 m 1 m 2 + + c r m 1 m 2 m r 1 n ( mod m ) .

This shows that 𝒞 is a complete system of residues modulo m = m 1 m 2 m r . □

User profile picture
2024-08-14 16:42
Comments