MathNet 2017-part-02 — 176 problems (EN–VI) Question 163

Let $n$ be a positive integer. Show that in a set $A$ of $2^{n}$ strictly positive numbers, one can choose a subset $B$ of size $n+1$ such that the sum of two different numbers of $B$ is never in $A$.