Let be a subset of the set such that for any two elements , the difference does not divide the sum . Find the maximum possible size of .
Problem 919
Official solution
From each of the sets at most 1 element can be in . This leads to an upper bound of which we can obtain with the set .