Question 6
You are given $n \ge 2$ distinct positive integers. A pair of integers is called *elegant* if their sum is $2^k$ for some positive integer $k$. For each $n$ find the largest possible number of *elegant* pairs.
(Oleksii Masalitin)
(Oleksii Masalitin)