Let and be two sets containing four and two elements respectively. Then the number of subsets of the set , each having at least three elements is
We have two finite sets, namely and , whose cardinalities are given to be and respectively.
First, recall the definition of the Cartesian product of two sets.
For any sets and , the Cartesian product is defined as .
The number of ordered pairs in is obtained by the fundamental principle of counting: every element of can be paired with every element of , so the total number of pairs is the product .
Applying this to and , we obtain
Thus there are exactly distinct ordered pairs in . Consequently, is a set with eight elements.
Next, we are asked to count the subsets of that have at least three elements.
For a set with elements, the total number of all possible subsets (including the empty set) is given by the power set formula .
Here, since , the total number of all subsets of is
However, this total counts subsets of every possible size, from up to . We do not want every subset; we only want those subsets whose size (cardinality) is at least . Hence we must subtract the numbers of subsets that have fewer than elements, namely subsets with , , or elements.
To do that, we employ the binomial coefficient , which counts the number of subsets of size from an -element set.
We therefore compute:
gives the number of empty subsets, which is .
gives the number of single-element subsets, which is .
gives the number of two-element subsets. Using the combination formula , we obtain
Now we add these three quantities to find the total number of subsets that have fewer than three elements:
Finally, we subtract this result from the grand total of subsets to get the desired count of subsets with at least three elements:
Therefore, the number of subsets of each having at least three elements is .
Hence, the correct answer is Option B.
Tagged Cartesian products and counting relations. Machine-assigned, so read it as a strong shortlist rather than a verdict.