Browse · MathNet
Print67th Czech and Slovak Mathematical Olympiad
Czech Republic counting and probability
Problem
Find the largest possible size of a set of integers with the following property: Among any three distinct numbers from , there exist two numbers whose sum is a power of with non-negative integer exponent.
Solution
The set attests that can have elements: The sum of any two numbers from the triplet is a power of two and the same is true for triplet . For the sake of contradiction, assume that some set has more than elements.
Clearly, can't contain three (or more) non-positive numbers. Hence it contains at least five positive numbers. Denote by the largest positive number in and by some four other positive numbers in . Consider pairs . They are all larger than and less than . The open interval contains at most one power of two, hence at least three of the four sums are not a power of two. Without loss of generality, assume those are . Considering the triplets we infer that all are powers of two. However, this is impossible. Without loss of generality, let . Then and both lie in , hence at least one of them is not a power of two, a contradiction.
Clearly, can't contain three (or more) non-positive numbers. Hence it contains at least five positive numbers. Denote by the largest positive number in and by some four other positive numbers in . Consider pairs . They are all larger than and less than . The open interval contains at most one power of two, hence at least three of the four sums are not a power of two. Without loss of generality, assume those are . Considering the triplets we infer that all are powers of two. However, this is impossible. Without loss of generality, let . Then and both lie in , hence at least one of them is not a power of two, a contradiction.
Final answer
6
Techniques
Coloring schemes, extremal argumentsIntegersOther