Solved: Let S be a set of ten integers chosen from 1
Chapter 9, Problem 9.168(choose chapter or problem)
Let S be a set of ten integers chosen from 1 through 50. Show that the set contains at least two different (but not necessarily disjoint) subsets of four integers that add up to the same number. (For instance, if the ten numbers are {3,8,9,18,24,34,35,41,44,50},thesubsetscanbetaken to be {8,24,34,35} and {9,18,24,50}. The numbers in both of these add up to 101.)
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer