Counting & Probability · Superchallenge problem

What is the smallest $n$ such that every set of $n$ different numbers chosen from $\{1,2,\dots,20\}$ must contain two numbers whose sum is a power of $2$?