C.f. Engel's Problem Solving Strategies; p. 132, #33:
Out of $n+1$ integers $\leq 2n$, find $p,q$ s.t. $p|q$.
Rather than soliciting a solution I'm wondering if there's a way I can make my attempt complete.... Please don't spoil the problem with random solutions! :-)
We can show there are at most $n$ primes $1\leq p\leq 2n$; call them $p_1,p_2,\dots,p_k$; $k\leq n$. Letting $s\in\{1,2,\dots, 2n\}$, write $s$ uniquely in prime-power form: $s=p_1^{s_1}p_{2}^{s_2}\dots p_k^{s_k}$. Define $\sigma(s)=(s_1,s_2,\dots,s_k)$. On the set $\{\sigma(s):1\leq s\leq 2n\}$, put a partial order $\sigma(s)\leq \sigma(t)\iff s_i\leq t_i $ for $1\leq i\leq k$, where $\sigma(t)=(t_1,t_2,\dots,t_k)$. It is clear that $s|t\iff \sigma(s)\leq \sigma(t)$. The problem is reduced to showing that out of all $n+1$ sequences, at least $2$ must be related.
To me, all that seems to remain is a combinatorics problem. Suppose that all $n+1$ sequences cannot be related. Why is this a contradiction? I can see why in a couple of extreme cases but not in the general case. Struggling to find the pigeonhole so to speak. Any hints?