Step 1: A relation is reflexive if for every element \( a \in \mathbb{Q}^* \), \( a \, R \, a \). In this case, since \( a = \frac{1}{a} \), the relation is reflexive.
Step 2: A relation is symmetric if \( a \, R \, b \) implies \( b \, R \, a \). In this case, if \( a = \frac{1}{b} \), then \( b = \frac{1}{a} \), so the relation is symmetric.
Step 3: A relation is transitive if \( a \, R \, b \) and \( b \, R \, c \) implies \( a \, R \, c \). In this case, it holds that if \( a = \frac{1}{b} \) and \( b = \frac{1}{c} \), then \( a = \frac{1}{c} \), so the relation is transitive.
Thus, the relation is reflexive, symmetric, and transitive, so the correct answer is (A). \bigskip
Let $R$ be a relation defined on the set $\{1,2,3,4\times\{1,2,3,4\}$ by \[ R=\{((a,b),(c,d)) : 2a+3b=3c+4d\} \] Then the number of elements in $R$ is
Let \(M = \{1, 2, 3, ....., 16\}\), if a relation R defined on set M such that R = \((x, y) : 4y = 5x – 3, x, y (\in) M\). How many elements should be added to R to make it symmetric.