Question 180
Let a finite set of integers be given, such that each of its elements can be written as a sum of some two elements (not necessarily distinct) from the same set. For such a set, we say that it is of 'safety of order $n$' if it does not contain a subset of $n$ or less elements whose sum is $0$. Prove that there exist sets of arbitrarily large safety order.