If $R = \{(6, 6), (9, 9), (6, 12), (12, 12), (12, 6)\}$ is a relation on set $A = \{3, 6, 9, 12\}$,then relation $R$ is

Let $A = \{1, 2, 3, 4\}$ and $R = \{(1, 2), (2, 3), (1, 4)\}$ be a relation on $A$. Let $S$ be the smallest equivalence relation on $A$ such that $R \subset S$. If the number of elements in $S$ is $n$,then the value of $n$ is:

Let $A = \{-4, -3, -2, 0, 1, 3, 4\}$ and $R = \{(a, b) \in A \times A : b = |a| \text{ or } b^2 = a + 1\}$ be a relation on $A$. Then the minimum number of elements that must be added to the relation $R$ so that it becomes reflexive and symmetric is $........$.

Let $R$ be an equivalence relation on a finite set $A$ having $n$ elements. Then the number of ordered pairs in $R$ is:

Show that the relation $R$ in the set $A = \{x \in Z : 0 \leq x \leq 12\},$ given by $R = \{(a, b) : |a - b| \text{ is a multiple of } 4\},$ is an equivalence relation. Find the set of all elements related to $1$.

Let $R$ be a reflexive relation on a finite set $A$ containing $n$ elements,and let $R$ contain $m$ ordered pairs. Then,