Let $A=\{1,2,3, \ldots \ldots \ldots \ldots, 100\}$. Let $R$ be a relation on $\mathrm{A}$ defined by $(x, y) \in R$ if and only if $2 x=3 y$. Let $R_1$ be a symmetric relation on $A$ such that $R \subset R_1$ and the number of elements in $R_1$ is $\mathrm{n}$. Then, the minimum value of $\mathrm{n}$ is _________.

Let $A = {1, 2, 3, ..., 100}$ and $R$ be a relation on $A$ such that $R = {(a, b) : a = 2b + 1}$. Let $(a_1, a_2), (a_2, a_3), (a_3, a_4), ..., (a_k, a_{k+1})$ be a sequence of $k$ elements of $R$ such that the second entry of an ordered pair is equal to the first entry of the next ordered pair. Then the largest integer k , for which such a sequence exists, is equal to :

If $A = {x \in R : |x| < 2}$ and $B = {x \in R : |x – 2| \geq 3}$; then :

Let $A = \{ (\alpha, \beta) \in R \times R : |\alpha - 1| \leq 4 \text{ and } |\beta - 5| \leq 6 \}$ and $B = \{ (\alpha, \beta) \in R \times R : 16(\alpha - 2)^2 + 9(\beta - 6)^2 \leq 144 \}$. Then

Let $R = \{(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)\}$ be a relation on the set $A = \{1, 2, 3, 4\}$. The relation $R$ is: