1. How many non-empty subsets containing only prime numbers does the set {1, 2, 3, 4, 5, 6, 7} have?
We have four primes
The number of subsets formed by choosing any prime = C(4, 1) = 4
The number of subsets formed by choosing any two of the primes = C(4, 2) = 6
The number of subsets formed by choosing any 3 of the primes = C(4,3) = 4
And...if we are allowed an improper subet.....one more containing all the primes
So
4 + 6 + 4 + 1 = 15 subsets
Note that this is just the sum of the elements of the 4th row of Pascal's Triangle - 1 =
2^4 - 1 = 15