Problem of the Day

10 October 2008

Problem. Given any n + 2 integers, show that, for some pair of them, their
sum or difference is divisible by 2n.
Solution. For each of the given integers, compute the absolute value of
the difference between it and the nearest multiple of 2n. The result is one
of the numbers 0, 1, 2, . . . , n. Since there are n + 2 given integers, one of
the results, say r, is obtained at least twice (by the Pigeonhole Principle).
Consequently, there are integers u and v in the set of given integers such that
one of the following holds (for some integers p and q):
(i) u = 2np + r, v = 2nq + r
(ii) u = 2np + r, v = 2nq r
(iii) u = 2np r, v = 2nq r
In cases (i) and (iii), u v is divisible by 2n, while in case (ii), u + v is
divisible by 2n.
2