Let be a set of distinct integers and suppose that
has exactly distinct elements. Prove that, when arranged in increasing order, the elements of form an arithmetic progression.
Solution
Write where . The elements
account for all the elements of . Now lies between and , so it must be . So , say. Proceeding by induction, having shown that , for some , observe that lies between and , so , giving .
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.