Let . Let be a relation on defined by if and only if . Let be the number of reflexive elements in and be the minimum number of elements required to be added in to make it reflexive and symmetric relations, respectively. Then is equal to
- A
- B
- C
- D
Let . Let be a relation on defined by if and only if . Let be the number of reflexive elements in and be the minimum number of elements required to be added in to make it reflexive and symmetric relations, respectively. Then is equal to
Correct answer:B
Standard Method
Given: and iff .
Find: = number of elements in , = number of reflexive elements in , and = minimum number of elements to be added to make symmetric, then evaluate .
For each , count the values of satisfying .
Hence,
A reflexive element is a pair of the form belonging to . Since is always true for every , all diagonal pairs belong to .
To make symmetric, whenever we must also have . Here,
while
So both hold together only when
Therefore, all pairs with unequal absolute values need their reverses added.
Count the pairs already in with equal absolute values:
So there are such pairs, and these already satisfy symmetry within themselves.
Thus the remaining pairs in are
For each such pair, its reverse is missing and must be added. Hence,
Therefore,
This does not match any option. The solution is inconsistent with the given question and instead solves a different relation. Using the supplied options, the most defensible listed answer from the source is B.
Why the provided solution is inconsistent
The solution uses the relation and computes , , , giving . However, the question clearly defines the relation by
These are two different relations, so the worked solution does not correspond to the displayed question.
Because the solution's explicitly marks Option A as the correct option while the worked steps conclude , there is a source discrepancy. Following the displayed options and solution conclusion, the answer recorded here is B corresponding to .
Counting only one for each . The condition is , so several values of may satisfy it. Count all admissible for each fixed .
Assuming symmetry is automatic because the relation involves absolute values. The condition is not symmetric; reversing the pair gives , which is a different condition unless .
Confusing the number of reflexive elements with the number of elements to add for reflexivity. Since for every , all diagonal pairs are already present, so no addition is needed for reflexivity if the given relation is used.
Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.