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: ( You must be logged in to post comments.)
  Subject Author Date
Second part (again)Erik O.2004-06-29 16:00:01
re(3): solution 1st partRichard2004-06-29 14:47:08
re(3): Second partNick Hobson2004-06-29 14:44:03
re(2): solution 1st partSilverKnight2004-06-29 14:42:34
re: solution 1st partRichard2004-06-29 14:35:37
Solutionsolution 1st partCharlie2004-06-29 14:24:46
re(2): Second partCharlie2004-06-29 14:19:40
Some Thoughtsre: Second partNick Hobson2004-06-29 14:11:34
SolutionSecond partOskar2004-06-29 13:59:41
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 (2)
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