Let A be a set of six positive integers each of which is less than 15. Show that there must be two distinct subsets of A whose elements when added up give the same su,.(Thanks to Jonathan Goldstine for this problem.)
There are two distinct subsets of whose elements when added up give the same sum.
The given statement is let be a set of six positive integers each of which is less than .
It is known that the total number of subsets of elements is found by using .
So, the total number of subsets of the six integers is
The largest possible sum for a set of six positive integers when each integer is less than is
The smallest possible sum is zero because of empty set.
So totally there are totally possible sums
Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!Get Started