Let $a_1 < a_2 < .... < a_n < 2n$ ne $n$ positive integers such that $a_j$ does not divide $a_k$ or $j \not= k$. Prove that $a_1 \geq 2^{k}$ where $k$ is defined by the condition $3^{k} < 2n < 3^{k+1}$ and show that it is the best estimate for $a_1$
Source: Indian Postal Coaching 2005
Tags: combinatorics unsolved, combinatorics
Let $a_1 < a_2 < .... < a_n < 2n$ ne $n$ positive integers such that $a_j$ does not divide $a_k$ or $j \not= k$. Prove that $a_1 \geq 2^{k}$ where $k$ is defined by the condition $3^{k} < 2n < 3^{k+1}$ and show that it is the best estimate for $a_1$