Fourteen sacks of gold

[Rainman]

A treasure hunter has just found 14 sacks of gold on a pedestal in a temple. The problem is, by taking the gold sacks he awakened the two guardians of the temple and was captured. The guardians have agreed to spare his life if he can give to both of them the same non-zero amount of gold, without opening the sacks.

• Each sack is marked with a distinct 3 digit number (anything from 001 to 999) and contains that much gold.
• After the guardians have received their gold, the treasure hunter must place all remaining gold sacks back on the pedestal.

To make this more difficult for you, I will not tell you how much gold each sack contains. Instead I will ask you to show that the treasure hunter can always appease the guardians.

A more mathematical way of phrasing the problem: given a set of 14 integers S = {n₁, n₂, ..., n₁₄}, where 0 < n_i < 1000 for all i, show that there must exist two disjoint non-empty subsets of S with the same sum.

[witzar]

There are 2^14-1 = 16383 non-empty subsets of S, sum of each non-empty subset of S is a positive integer <= 14*999 = 13986.

There have to exist two distinct non-empty subsets of S, call them A and B, with the same sum (due to the pigeonhole principle).
(A-B) and (B-A) are non-empty disjoint subsets of S with the same sum.

[bonanova]

There is a set of ten sacks for which this fails.

Suppose the numbers were 2ⁿ, n = 0, 1, 2, ..., 9, after which we'd need 4 digits.

These numbers form a basis set, none of which are combinations of the others.

But if we add a 3 to the set, we can always get two equal sets:

1 + 2 = 3

1 + 3 = 4

1 + 3 + 4 = 8

1 + 3 + 4 + 8 = 16

etc.