Suppose you choose 14 of the integers from 1 to 1111, inclusive.
Show that in any such set there are two subsets having the same sum for their elements.
It is not necessarily true that the union of the two subsets is the full 14 element set.
(In reply to
. by Bradley Bauer)
WHAT'S THE MATTER WITH YOU?
WHY DESPITE REPEATED REMINDERS, YOU ARE STILL INDULGING IN EXTREME UNRELIABILITY AND IDIOCY BY POSTING SUCH CHILDISH COMMENTS IN A MATH/LOGIC WEBSITE?