Let A be a set of six positive integers each of which is

Chapter 9, Problem 32E

(choose chapter or problem)

Problem 32E

Let A be a set of six positive integers each of which is less than 13. Show that there must be two distinct subsets of A whose elements when added up give the same sum. (For example, if A = {5, 12, 10, 1, 3, 4}, then the elements of the subsets S1 = {1,4, 10} and S2 = {5, 10} both add up to 15.)

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

×

Login

Login or Sign up for access to all of our study tools and educational content!

Forgot password?
Register Now

×

Register

Sign up for access to all content on our site!

Or login if you already have an account

×

Reset password

If you have an active account we’ll send you an e-mail for password recovery

Or login if you have your password back