Let , where each contains 10 elements and each contains 5 elements. If each element of the set is an element of exactly 20 of sets 's and exactly 6 of sets 's then is equal to:
Let us denote the number of distinct elements in the union by . We begin with the family .
Each set contains 10 elements, so the total of all ordered pairs “(set, element in that set)” contributed by the 50 sets equals
However, the statement tells us that every single element of lies in exactly 20 of the ’s. Hence, if we count the same ordered pairs by first choosing an element of and then choosing the set that contains it, we obtain
Because both computations refer to the same collection of ordered pairs, they are equal. Therefore
Now we turn to the family . Each has 5 elements, so the total number of ordered pairs “(set, element in that set)” here is
Again, the problem states that every element of appears in exactly 6 of the ’s. Counting by first picking an element and then one of the 6 sets that contain it gives
Equating the two counts for the family, we have
Hence, the correct answer is Option D.
Tagged Sets, subsets, power sets and set operations. Machine-assigned, so read it as a strong shortlist rather than a verdict.