Question 5
Let $n$ be a positive integer. $n \ge 3$. There are $n$ pairwise different numbers written on a blackboard. Show that we can choose two of those numbers so that no number from the blackboard multiplied by $3$ is equal to a multiple of their sum.