Let . Let be a 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 reflexive relation. 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 and be the minimum number of elements required to be added in to make it a reflexive relation. then is equal to
Correct answer:D
Standard Method
Given: and is defined by .
Find: = number of ordered pairs in , = minimum number of ordered pairs to be added to make reflexive, and then compute .
For ,
so
and hence
Now check each value of :
Therefore,
To make reflexive, every for must belong to . So test
for each .
Checking diagonal pairs:
Thus the missing self-pairs are , , and . Hence
Finally,
Therefore, the correct option is D.
Count by fixing y
Given: with .
Find: .
Rewrite the condition as
Now fix each value of and count the possible values of .
Hence the total number of ordered pairs is
For reflexivity, all diagonal pairs must be present. From the condition , the missing pairs are , , and . Therefore
So,
Thus the correct option is D.
Counting ordered pairs as unordered pairs. Here and are different, because a relation is a set of ordered pairs. Always count each valid separately.
Assuming reflexive means only checking some convenient values. A relation on is reflexive only if every for all is present. Check all seven elements of .
Making an algebra mistake while converting into bounds for . Divide the whole inequality correctly by to get .
Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.