0

Let $S\subseteq \{1,2,...,3n\}$ be a set of cardinality $2n+1$. Prove there exist $x,y \in S$ such that $x|y$.

Not quite sure where to approach this from. I tried using the pigeonhole principle on equivalence classes of the relation $xRy \iff x|y$ but the problem is that this relation is not an equivalence relation.

1 Answers1

2

For each $l\in \{1,\dots,3n\}$ such that $l$ is odd, let $$ S_l:=\{l,2l,2^2l,\cdots,2^\alpha l\} $$ where $\alpha$ is the largest integer such that $2^\alpha l\le 3n$. That is, $\alpha =\left\lfloor \log_2 \left(\frac{3n}{l}\right)\right\rfloor$. Note that, for any $x, y\in S_l$, we either have $x\mid y$ or $y\mid x$. As $$\{1,2,\cdots,3n\}=\mathop{\bigcup}\limits_{1\le l\le 3n, \;l\text{ is odd}}S_l, $$ and there are fewer than $2n+1$ odd numbers in $\{1,\dots,3n\}$, there must be two elements $x\ne y\in S$ such that $\exists l, x,y\in S_l$.

You can see that the number $2n+1$ is far from optimal.

Mike Earnest
  • 84,902