Let . Let be the relation on defined by if and only if . Let be the number of elements in , and be the minimum number of elements required to be added in to make it a symmetric relation. Then is equal to :
- A
- B
- C
- D
Let . Let be the relation on defined by if and only if . Let be the number of elements in , and be the minimum number of elements required to be added in to make it a symmetric relation. Then is equal to :
Correct answer:C
Standard Method
Given: and is defined by .
Find: The value of , where is the number of elements in and is the minimum number of elements to be added to make symmetric.
A relation is symmetric if whenever , then must also hold.
We first count all ordered pairs in .
For :
Possible are , so there are pairs.
For :
Possible are , so there are pairs.
For :
Possible are , so there are pairs.
For :
Possible are , so there are pairs.
For :
Possible are , so there are pairs.
Therefore,
Now check which pairs need their reverse ordered pair to make the relation symmetric.
Pairs with $$x
Counting and symmetry check
Given: on .
Find: First compute , then compute the minimum additional pairs needed for symmetry.
To count , fix each value of and determine all allowed values of .
Thus,
For symmetry, diagonal pairs such as do not create any issue because their reverse is the same pair.
So we only inspect non-diagonal pairs. Every time but , one new pair must be added.
The missing reverse pairs are exactly:
Therefore,
And hence,
Therefore, the value of is .
Counting only pairs with while finding is incorrect because is a relation on and includes ordered pairs with and also pairs with whenever holds. Count all valid ordered pairs row-wise for each fixed .
Assuming every pair needs a distinct reverse pair, including diagonal pairs, is wrong. For symmetry, diagonal pairs such as already satisfy their own reflection condition. Only non-diagonal pairs need checking.
Using the inequality in the reverse direction, such as checking incorrectly or forgetting to test separately, leads to wrong values of . For each pair in , explicitly test whether also satisfies .
Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.