All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
Subsetting a set (Posted on 2004-06-29) Difficulty: 3 of 5
Out of the set {1,2,3...100} take any subset of ten numbers and call it T. Prove you can find two disjoint subsets of T such as the sum of the numbers in each subset is the same.

Note: the subsets need not include every number in T; in fact, if you asked for this condition, the problem might be impossible (prove it!).

See The Solution Submitted by Federico Kereki    
Rating: 3.8000 (5 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re(2): Second part | Comment 3 of 9 |
(In reply to re: Second part by Nick Hobson)

Oskar's comment was for the second part, which does require that the union of the two subsets must be T.  The first part doesn't require that, but the second part does.
  Posted by Charlie on 2004-06-29 14:19:40

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information