Choose Two. No Eleven.

How many subsets of S = { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 } S = \{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}\} have the property that no two elements of S S sum to 11 11 ?


The answer is 243.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Alex Li
Jun 4, 2015

Consider splitting the set into the 5 5 subsets that sum up to 11 11 . Note that we can choose either element to be in the subset, or neither, but not both. There are 3 3 possibilities for each subset, so there are 3 5 = 243 3^5=\boxed{243} total possibilities.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...