Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 4.5.3* (There are two integers in $\mathscr{S}$ whose sum or whose difference is divisible by $m$)

Exercise 4.5.3* (There are two integers in $\mathscr{S}$ whose sum or whose difference is divisible by $m$)

For any positive integers k and m > 1 , let 𝒮 be a set of k integers none of which is a multiple of m . If k > m 2 , prove that there are two integers in 𝒮 whose sum or whose difference is divisible by m .

Answers

(See the note in the solution of Problem 1.)

Proof. Let a ¯ denote the class of a in mℤ .

Let 𝒫 be the set of unordered pairs { x , x } , where x mℤ { 0 } :

𝒫 = { { x , x } x mℤ { 0 } } .

Note that if m is even and x = m 2 ¯ , then { x , x } is the singleton { m 2 ¯ } . For instance, for m = 6 , 𝒫 = { { 1 ¯ , 1 ¯ } , { 2 ¯ , 2 ¯ } , { 3 ¯ } } .

Consider now the map

φ { 𝒮 𝒫 a { a ¯ , a ¯ } .

Since 𝒮 is a set of k integers none of which is a multiple of m , then for all a 𝒮 , a ¯ mℤ { 0 } , so { a ¯ , a ¯ } 𝒫 .

  • If m is odd, then

    𝒫 = { { 1 ¯ , 1 ¯ } , { 2 ¯ , 2 ¯ } , , { m 1 2 ¯ , m 1 2 ¯ } } ,

    thus Card ( 𝒫 ) = ( m 1 ) 2 .

  • If m is even, then

    𝒫 = { { 1 ¯ , 1 ¯ } , { 2 ¯ , 2 ¯ } , , { m 2 1 ¯ , ( m 2 + 1 ¯ ) } , { m 2 ¯ } } ,

    thus Card ( 𝒫 ) = m 2 .

In both cases,

Card ( 𝒫 ) m 2 < k = Card ( 𝒮 ) .

Therefore φ cannot be injective, so there are two elements a , b in 𝒮 such that

a b  and  { a ¯ , a ¯ } = { b ¯ , b ¯ } .

Since a ¯ { b ¯ , b ¯ } , we obtain

a ¯ = b ¯  or  a ¯ = b ¯ ,

thus m a b or m a + b .

If 𝒮 is a set of k > m 2 integers none of which is a multiple of m , then there are two integers in 𝒮 whose sum or whose difference is divisible by m . □

User profile picture
2025-03-15 09:51
Comments