Let and be the relation defined on such that is odd positive integer or . The minimum number of elements that must be added to the relation , so that it is a symmetric relation, is equal to ______.
To solve this as written, we must find every pair that satisfies the given rules and then count how many "reverse" pairs are missing.
The set is .
Condition A:
Comparing all elements where the difference is exactly 2:
(Total: 4 pairs)
Condition B: is an odd positive integer
We look for where the result is :
(Total: 15 pairs)
For to be symmetric, if , then must be in .
In the current relation, is always greater than ( or ). Therefore, in every existing pair, .
For any reverse pair , the difference would be negative.
This means none of the reverse pairs are currently in .
Total elements in .
To make it symmetric, you must add the reverse of every element.
Mathematically, the number to add is 19.
Tagged Reflexive, symmetric and transitive relations. Machine-assigned, so read it as a strong shortlist rather than a verdict.