## Welcome to BrainDen.com - Brain Teasers Forum

Welcome to BrainDen.com - Brain Teasers Forum. Like most online communities you must register to post in our community, but don't worry this is a simple free process. To be a part of BrainDen Forums you may create a new account or sign in if you already have an account. As a member you could start new topics, reply to others, subscribe to topics/forums to get automatic updates, get your own profile and make new friends. Of course, you can also enjoy our collection of amazing optical illusions and cool math games. If you like our site, you may support us by simply clicking Google "+1" or Facebook "Like" buttons at the top. If you have a website, we would appreciate a little link to BrainDen. Thanks and enjoy the Den :-) |

# Fourteen sacks of gold

### #1

Posted 30 July 2013 - 01:01 PM

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_{1}, n_{2}, ..., n_{14}}, where 0 < n_{i} < 1000 for all i, show that there must exist two disjoint non-empty subsets of S with the same sum.

### #2

Posted 31 July 2013 - 03:09 AM

*The greatest challenge to any thinker is stating the problem in a way that will allow a solution.*

- Bertrand Russell

### #3

Posted 31 July 2013 - 11:08 AM Best Answer

#### 0 user(s) are reading this topic

0 members, 0 guests, 0 anonymous users