Let the number of elements in sets and be five and two respectively. Then the number of subsets of each having at least and at most elements is:
- A
- B
- C
- D
Let the number of elements in sets and be five and two respectively. Then the number of subsets of each having at least and at most elements is:
Correct answer:D
Standard Method
Given: The number of elements in sets and are and respectively.
Find: The number of subsets of having at least and at most elements.
First, find the number of elements in the Cartesian product:
So, has elements.
A subset with exactly elements can be chosen in ways. Therefore, the required number of subsets is
Now compute each term:
Adding these values:
Therefore, the number of subsets is . The correct option is D.
Using symmetry of combinations
Given: and .
Find: The number of subsets of with size from to .
Since
the required count is
Use the symmetry property
So the sum becomes
That is,
Therefore, the required number of subsets is .
Using instead of for the number of elements in . This is wrong because a Cartesian product counts ordered pairs, so multiply the number of choices. Use .
Counting all subsets as the answer. This is wrong because gives every subset of , while the question asks only for subsets having between and elements. Restrict the count to .
Forgetting one of the required sizes, especially omitting subsets with exactly elements or including subsets with or elements. This is wrong because 'at least and at most ' includes only sizes . List the allowed sizes before applying combinations.
Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.