Question 62
Let $n$ be a natural number. We call a pair of numbers incompatible if their greatest common divisor equals $1$. What is the minimum number of incompatible pairs that occur when the numbers $\{1, 2, \ldots, 2n\}$ are split into $n$ pairs?