Wanted 9, Renegade 0
Level
2
Let A = {0,1,2,3,4,5,6,7,8,9}. The number of subsets of A containing 9 but not 0 is ?
512
1023
256
9
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
Number of subsets = 2^{n} where n is the number of elements in the set. We take 2^{n-2} here since we remove 0,9 from the sets and add 9 to the resulting subsets. Hence the answer is 2^{10-2} = 2^{8} = 256.