## Problem #022 - coprimes in the crowd

This simple problem is an example of a very interesting phenomenon: if you have a large enough "universe" to consider, even randomly picked parts exhibit structured properties. # Problem statement

Let $$n \geq 2$$ be an integer. Then, consider the integers

$\{3, 4, \cdots, 2n-1, 2n\}\ .$

Show that, if you pick $$n$$ from those, you always have two numbers that will share no divisors whatsoever.

In other words, show that there's two of those $$n$$ numbers that are coprime.

If you need any clarification whatsoever, feel free to ask in the comment section below.

# Solution

The solution is a simple application of the pigeonhole principle.

For some $$n \geq 2$$, consider the following $$n-1$$ pairs of integers:

$\{3, 4\}, \{5, 6\}, \cdots, \{2n-1, 2n\}$

which together make up for the whole set $$\{3, 4, \cdots, 2n-1, 2n\}$$. If we pick $$n$$ numbers from this set (the pigeons) and if we look for the pairs from where they came (the holes) then we see we must have picked two consecutive integers from one of the pairs. Those two numbers that came from the same pair are consecutive integers, and hence are coprime!

To see that two consecutive integers are coprime, you can read this twitter proof.