How many subsets of contain at least one prime number?
Pick one
Solution
Since an element of a subset is either in or out, the total number of subsets of the -element set is . However, since we are only concerned about the subsets with at least prime in it, we can use complementary counting to count the subsets without a prime and subtract that from the total. Because there are non-primes, there are subsets with at least prime.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.