Olympiad Maths Prep

Library / /6 of 10

Combinatorics Difficulty 6.2 National olympiad Prove it Czech Republic

Find the largest possible size of a set MM of integers with the following property: Among any three distinct numbers from MM, there exist two numbers whose sum is a power of 22 with non-negative integer exponent.

Solution

The set {1,3,5,2,6,10}\{-1, 3, 5, -2, 6, 10\} attests that MM can have 66 elements: The sum of any two numbers from the triplet (1,3,5)(-1, 3, 5) is a power of two and the same is true for triplet (2,6,10)(-2, 6, 10). For the sake of contradiction, assume that some set MM has more than 66 elements.

Clearly, MM can't contain three (or more) non-positive numbers. Hence it contains at least five positive numbers. Denote by xx the largest positive number in MM and by a,b,c,da, b, c, d some four other positive numbers in MM. Consider pairs x+a,x+b,x+c,x+dx + a, x + b, x + c, x + d. They are all larger than xx and less than 2x2x. The open interval (x,2x)(x, 2x) 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 x+a,x+b,x+cx + a, x + b, x + c. Considering the triplets (a,b,x),(a,c,x),(b,c,x)(a, b, x), (a, c, x), (b, c, x) we infer that all a+b,a+c,b+ca + b, a + c, b + c are powers of two. However, this is impossible. Without loss of generality, let a=max{a,b,c}a = \max\{a, b, c\}. Then a+ba + b and a+ca + c both lie in (a,2a)(a, 2a), hence at least one of them is not a power of two, a contradiction.

Looking for a route rather than an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.