Maths Olympiad Prep

Library / /277 of 520

Combinatorics Difficulty 5.3 AIME, harder Find the answer

7. Let A={2,4,,2014},BA=\{2,4, \cdots, 2014\}, B be any non-empty subset of AA, and aiaja_{i} 、 a_{j} be any two elements in set BB. There is exactly one isosceles triangle with aiaja_{i} 、 a_{j} as side lengths. Then the maximum number of elements in set BB is \qquad

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

7. 10 .

By symmetry, without loss of generality, assume ai<aja_{i}<a_{j}. Then there must exist an isosceles triangle with aja_{j} as the waist and aia_{i} as the base, and there is only one isosceles triangle with aia_{i} and aja_{j} as side lengths.
Thus, ai+aiajaj2aia_{i}+a_{i} \leqslant a_{j} \Rightarrow a_{j} \geqslant 2 a_{i}.
This indicates that, when the elements of set BB are arranged in ascending order, each subsequent element is at least twice the previous one.
Therefore, when the number of elements is maximized, the set
B={2,4,8,16,32,64,128,256,512,1024} B=\{2,4,8,16,32,64,128,256,512,1024\} \text {. }

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.