Let and be two sets containing 2 elements and 4 elements respectively. The number of subsets of having 3 or more elements is :
We begin by noting the basic facts given in the question. The set contains elements, and the set contains elements. Whenever we form the Cartesian product , each element of pairs with every element of .
By definition of Cartesian product, the total number of ordered pairs in equals the product of the individual cardinalities:
Substituting the given sizes, we obtain
So, the set has exactly elements.
Next, we recall a standard counting fact: a finite set with elements possesses distinct subsets. Stating this formally, if a set has elements, then
Applying this to our situation with , we have
However, the problem does not ask for all subsets. It asks only for those subsets that contain three or more elements. Therefore we must exclude the subsets of sizes , , and from the grand total of .
To exclude them accurately, we use the combination formula. The number of ways to choose elements from an -element set is given by the binomial coefficient
For our set with , we compute:
The total number of “small” subsets (those having fewer than elements) is therefore
Now we subtract these unwanted subsets from the complete collection of subsets:
This final result, , is precisely the number of subsets of that contain or more elements.
Hence, the correct answer is Option A.
Tagged Combinations and selections with conditions. Machine-assigned, so read it as a strong shortlist rather than a verdict.