Let $A = \{1, 2, 3\}$. The number of equivalence relations on $A$ containing $(1, 2)$ is . . . . . . .

Let $A = \{0, 1, 2, 3, 4, 5\}$. Let $R$ be a relation on $A$ defined by $(x, y) \in R$ if and only if $\max\{x, y\} \in \{3, 4\}$. Then among the statements $(S_1)$: The number of elements in $R$ is $18$,and $(S_2)$: The relation $R$ is symmetric but neither reflexive nor transitive:

The relation "congruence modulo $m$" is:

Give an example of a relation on a set $A = \{4, 6, 8\}$ which is reflexive and symmetric but not transitive.

Let $A = \{0, 3, 4, 6, 7, 8, 9, 10\}$ and $R$ be the relation defined on $A$ such that $R = \{(x, y) \in A \times A : x - y \text{ is an odd positive integer or } x - y = 2\}$. The minimum number of elements that must be added to the relation $R$ so that it becomes a symmetric relation is equal to $...........$.

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 $........$.