Let be a set of numbers chosen from with the property that any two distinct numbers, say and , in determine a unique isosceles triangle (which is non-equilateral) whose sides are of length or . What is the largest possible size of ?
, 2015
Solution
Let be two numbers in . For them to determine a unique isosceles triangle, we must have . If , then any two of the numbers satisfy . So the maximum size is .
Now suppose that there is a set with that has the property. Let be the elements of in increasing order. Then , , , , a contradiction (since ). Thus the maximum size is .
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.