More on Sets

This section delves into combinatorics problems presented as set theory questions. To find the number of subsets containing a specific number of elements ($k$) from a set with $n$ total elements, you use the combinations formula, $nC_k$.

For example, to find the number of subsets with exactly 2 elements from the set {N, U, M, B, E, R} (which has 6 elements), you calculate $6C_2 = \frac{6!}{2!(6-2)!} = 15$.

If asked for the number of subsets with either 2 or 3 elements, you would calculate $6C_2 + 6C_3$.