Let and . Let be a relation defined on such that . Then the number of elements in the set is:
- A
- B
- C
- D
Let and . Let be a relation defined on such that . Then the number of elements in the set is:
Correct answer:C
Standard Method
Given: , , and .
Find: The number of elements in .
Count the valid pairs for the condition .
For , there are choices of . For , there are choices of . For , there are choices of . For , there are choices of . For , there is choice of .
So the total number of choices for is
Now count the valid pairs for the condition .
For , there are choices of . For , there are choices of . For , there are choices of . For , there is choice of . For , there are choices of .
So the total number of choices for is
Therefore, the total number of elements in is
The required number of elements is .
Although the solution states "The Correct Option is C", the computed value matches option B among the given options. Hence, the correct option is B.
Counting by independent conditions
Given: The relation condition splits into two independent inequalities: and .
Find: Use separate counting and multiply the results.
The first inequality involves only and , while the second involves only and . Therefore, the total count is the product of the number of valid choices for these two parts.
This gives
So the correct option is B.
A common mistake is to stop after counting only the valid pairs satisfying and conclude the answer is . This is wrong because the relation depends on both inequalities. After counting valid pairs, also count valid pairs and multiply the two counts.
Another mistake is to ignore the element while counting choices for . This can lead to an incomplete table. Include as well, but note that it contributes choices of because no element of is at least .
Students may trust the printed option label from the solution without checking the actual value. Here the working gives , but the page labels the correct option as C. Always match the computed value with the listed options; corresponds to B.
Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.