View written solutionFree
Correct answer: 7
- Given set and relation
We have and
We must find the minimum number of ordered pairs to add so that becomes reflexive and symmetric.
- List all pairs in
We use the two conditions separately.
Condition 1:
Check each :
So from this condition:
Condition 2:
This gives Now test possible :
So from this condition:
Hence,
- Make reflexive
A relation on is reflexive if every for is present.
Required diagonal pairs are:
Already present:
Missing:
So for reflexivity, we must add 3 pairs.
- Make symmetric
A relation is symmetric if whenever , then .
Check each non-diagonal pair:
- requires , which is missing.
- requires , which is missing.
- requires , which is missing.
- requires , which is missing.
Diagonal pairs automatically satisfy symmetry.
So for symmetry, we must add 4 pairs:
- Check overlap between reflexive and symmetric additions
Reflexive additions needed:
Symmetric additions needed:
There is no overlap.
Therefore total minimum pairs to add:
- Final answer
The minimum number of elements to be added is
More from Sets and Relations
- The number of elements in the set and is a multiple of 7 is .2023 · Numerical
- Let and be a relation on the set defined by . Then the number of elements in is .2023 · Numerical
- The relation is :2023 · MCQ
- The minimum number of elements that must be added to the relation R = {(a, b), (b, c), (b, d)} on the set {a, b, c, d} so that it is an equivalence relation, is .2023 · Numerical
- Let S = {1, 2, 3, 5, 7, 10, 11}. The number of non-empty subsets of S that have the sum of all elements a multiple of 3, is .2023 · Numerical
- Let R be a relation defined on as if is a multiple of . Then R is2023 · MCQ
- The minimum number of elements that must be added to the relation on the set so that it becomes symmetric and transitive is :2023 · MCQ
- Let be a relation on defined by if and only if . Then is2023 · MCQ