Question 17
Let $S$ be the collection of all sets of $n$ distinct positive integers, with no three in arithmetic progression. Show that there is a member of $S$ which has the largest sum of the inverses of its elements (you do not have to find it or to show that it is unique).