7. Let be any non-empty subset of , and be any two elements in set . There is exactly one isosceles triangle with as side lengths. Then the maximum number of elements in set is
Solution
7. 10 .
By symmetry, without loss of generality, assume . Then there must exist an isosceles triangle with as the waist and as the base, and there is only one isosceles triangle with and as side lengths.
Thus, .
This indicates that, when the elements of set 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
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.