Prove that one of $(n+1)$ numbers chosen from $\{1,2, \dots, 2n\}$ is divisible by another. 

Select $n+1$ numbers $a_1, a_2, \dots, a_{n+1}$ and write them in the form
\[a_i=2^{k_i}b_i,\]
where $b_i$ are odd numbers between in $\{1, 2, \dots , 2n\}$. Since there are only $n$ such odd numbers, by pigeonhole principle we must have
\[b_i=b_j\]
for some $i,j $ with $i \neq j$. Now it is easy to see that one of $a_i$ or $a_j$ is divisible by the other.