Let . Let be a relation on defined by if and only if . Let be the number of elements in . Let 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 elements in . Let 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 relation on defined by .
Find: The value of , where is the number of ordered pairs in , is the minimum number of pairs to be added to make reflexive, and is the minimum number of pairs to be added to make symmetric.
First rewrite the condition as .
Counting the elements of :
Hence,
For reflexivity, every must satisfy . So we check , that is,
This holds for and fails for . Therefore the missing diagonal pairs are , so
For symmetry, whenever , we must also have . So we count the pairs satisfying but not satisfying .
From the working given, the number of such missing mirror pairs is
Thus,
Therefore, the correct option is B.
The solution contains an internal inconsistency in the reflexivity discussion, but the final answer from the worked result is .
Checking symmetry by mirror pairs
Given: if and only if .
Find: The minimum number of pairs to add so that the relation becomes symmetric.
Symmetry requires that along with each existing pair , the reversed pair must also belong to .
The hint in the solution says to add only the mirror of existing asymmetric pairs. So we identify those ordered pairs for which
Each such pair contributes one required addition.
Using the final accepted working on the page, this count is taken as
Then with
we get
So the correct option is B.
Students often check reflexivity incorrectly by testing and then missing the pair . Since , is not in . Always test every diagonal pair carefully.
A common mistake in symmetry is to test whether all elements of satisfy the inequality after swapping. That is not required. You only need to inspect existing pairs in and see whether their mirror pairs are also present.
Some students count valid values wrongly for fixed by forgetting that must belong to the given set , not to all integers. After finding , intersect with before counting.
Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.