- #1

- 84

- 0

## Homework Statement

We select

*n + 1*different integers from the set

*{1,2,...,2n}*. Prove that there will always be two among the selected integers whose largest common divisor is 1.

## Homework Equations

None

## The Attempt at a Solution

I was thinking that this problem has something to do with the pigeonhole principle, however I'm pretty stuck here and don't even know where to get started...