Let n be a natural number. Two numbers are called "unsociable" if their greatest common divisor is 1. The numbers {1,2,...,2n} are partitioned into n pairs. What is the minimum number of "unsociable" pairs that are formed? number theorygreatest common divisorset