Let be the numbers in some order. Suppose that and that . Prove that
, 2011
Solution
Note that for a given , and are never both in one of or . Suppose, without loss of generality, that . Then , and , giving elements less than or equal to , which is impossible. Then every is a difference between an element in and an element in . Therefore:
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.