Problem

Source: 2003 Romania JBMO TST 3.3

Tags: number theory, divisor, Sum, divides, combinatorics



A set of $2003$ positive integers is given. Show that one can find two elements such that their sum is not a divisor of the sum of the other elements.