Problem

Source: 2001 China National Olmpiad

Tags: number theory proposed, number theory



Let $X=\{1,2,\ldots,2001\}$. Find the least positive integer $m$ such that for each subset $W\subset X$ with $m$ elements, there exist $u,v\in W$ (not necessarily distinct) such that $u+v$ is of the form $2^{k}$, where $k$ is a positive integer.