Let A= {2, 3, 5, 7, 9}. Let R be the relation on A defined by x R y if and only if . Let l be the number of elements in R, and m be the minimum number of elements required to be added in R to make it a symmetric relation. Then l + m is equal to:
Count (elements in ).
• (5 pairs)
• (5 pairs)
• (3 pairs)
• (3 pairs)
• (2 pairs)
Total .
Count (additions for symmetry).
A relation is symmetric if .
We need to find pairs where but .
Pairs in : plus reflexives .
Check inverses:
• (False) Need to add 1.
•
Calculating usually results in the total possible pairs minus a few.
For this set, , . Total
Tagged Reflexive, symmetric and transitive relations. Machine-assigned, so read it as a strong shortlist rather than a verdict.