Problem

Source: IX International Festival of Young Mathematicians Sozopol, Theme for 10-12 grade

Tags: algebra, set, Inequality, algebra unsolved



$A = \{a_1, a_2, . . . , a_k\}$ is a set of positive integers for which the sum of some (we can have only one number too) different numbers from the set is equal to a different number i.e. there $2^k - 1$ different sums of different numbers from $A$. Prove that the following inequality holds: $\frac{1}{a_1}+\frac{1}{a_2}+...+\frac{1}{a_k}<2$