Suppose s is a set of 10 integers (any integers at all). prove that there are a pair of numbers in s whose difference is a multiple of 9; i. e. prove that there exists a, b ∈ s and an integer k ∈ z such that a − b = 9k. (hint: apply the pigeonhole principle to the potential remainders of elements of s with respect to division by 9).