How many subsets of contain at least one prime number?
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
Count all 2^8 subsets and subtract the 2^4 subsets built only from the four non-primes 4, 6, 8, 9.
Solution
The set has elements, so it has subsets in total.
The primes in the set are ; the non-primes are . A subset contains no prime exactly when it is a subset of , and there are of those (including the empty set).
Every other subset contains at least one prime:
The answer is .
Why this works
"At least one" is the signal for complementary counting: the complement "none" is a single clean case, here the subsets of the non-primes. The counts come from each element independently being in or out.
The trap
Miscounting the primes (there are exactly four: 2, 3, 5, 7) or forgetting that the empty set is one of the 16 prime-free subsets.
Common mistakes
- Miscounting the primes (there are exactly four: 2, 3, 5, 7) or forgetting that the empty set is one of the 16 prime-free subsets.
- Trying to count "at least one prime" directly by cases on the number of primes, which is slower and error-prone.
Techniques
Count the complement and subtract from the total