Browse · MathNet
Print67th NMO Selection Tests for BMO and IMO
Romania counting and probability
Problem
Given a positive integer , show that for no set of integers modulo , whose size exceeds , is it possible that the pairwise sums of unordered pairs be all distinct.
Solution
Let be a set whose pairwise sums of unordered pairs are distinct, and consider the pairwise differences of ordered pairs. The crucial observation is that if a difference occurs twice in , then these two occurrences must be adjacent in a 3-term arithmetic progression in (with difference ). Indeed, if are all in , where , then so, by assumption on , , i.e. the ordered pairs and are adjacent in a 3-term arithmetic progression. We also observe that, excepting the arithmetic progression of common difference , in case is even, no two 3-term arithmetic progressions can have the same central term, since if are all in , where are distinct, then would violate the assumption on . It follows that the number of 3-term arithmetic progressions in is at most . Now any non-zero difference not occurring in a 3-term arithmetic progression can appear at most once in , and those which do appear in 3-term arithmetic progressions can appear at most twice, except in case is divisible by 3, which can appear three times. Consequently, the total number of non-zero differences appearing in is at least . If , this quantity is greater than — a contradiction.
Techniques
Counting two waysPigeonhole principleColoring schemes, extremal argumentsOther