Question 92
Let $n$ be a positive integer. Consider pairs of elements of $\{1,2,\ldots,n\}$ having no element in common. Determine, with proof, the greatest possible number of such pairs whose element sums are pairwise distinct and at most $n$. (For example, $(1;9),(2;7),(3;5)$ are three possible pairs for $n=10$.)