Public Forums Talk Boxes Private Messages Live Chat
Personal Links
More Community

Usenet Newsgroups : rec.puzzles Hall of Fame


The rec.puzzles Hall of Fame is a compilation of over 500 of the most popular puzzles that have been posted and discussed in the rec.puzzles newsgroup. In most cases a detailed solution has been provided.

Many of these puzzles also appear in Braingle's own collection.

   
rec.puzzles
Newsgroup
FAQ
Hall of Fame
alt.brain.teasers
Newsgroup
FAQ
Categories : combinatorics : subsets.p

Out of the set of integers 1,...,100 you are given ten different
integers.  From this set, A, of ten integers you can always find two
disjoint non-empty subsets, S & T, such that the sum of elements in S
equals the sum of elements in T.  Note: S union T need not be all ten
elements of A.  Prove this.


Solution

Online Now
4 users and 615 guests

Users In Chat
autumn
Follow Braingle!
Fold 'N Fly Paper Airplanes
Easy to follow folding instructions and videos.
Copyright © 1999-2017 | FAQ | Widgets | Links | Green | Subscribe | Contact | Privacy | Conditions | Advertise | Braingle Time: 7:28 am
Sign In Create a free account