Solution 1
An example with integers is which works since for any . Now suppose there is with the given property and at least elements. Note that there are at least negative integers of the form for distinct - indeed, if the elements of are then , are such. Colour these differences in blue. Also, colour each element of (i.e. the integers ) in red. Now there are two cases:
- If there is an integer which is both red and blue, then for some and so we have which , which contradicts the hypothesis.
- Otherwise, no integer is both red and blue and since all coloured integers (which are at least in total) are between and , it follows that there is a difference of a red and a blue integer equal to and we get a contradiction as in the previous case (but with replaced by ).
Solution 2
An example with integers is which works since for a ny . Further assume that has (at least) elements and let denote the given set. Let be the elements of . Consider the following set (it's easy to check that it's well-defined and also a subset of )
By the problem's condition, and must be disjoint. But since and , we get a contradiction. This ends our proof.;
|