Consider the relations $R_1$ and $R_2$ defined as $aR_1b \Leftrightarrow a^2 + b^2 = 1$ for all $a, b \in R$ and $(a, b)R_2(c, d) \Leftrightarrow a+ d = b + c$ for all $(a, b), (c, d) \in N \times N$. Then:

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

Two sets A and B are as under : A = {$(a, b) ∈ R × R : |a - 5| < 1$ and $|b - 5| < 1$}; B = {$(a, b) ∈ R × R : 4(a - 6)^2 + 9(b - 5)^2 ≤ 36$}; Then

Define a relation $R$ over a class of $n imes n$ real matrices $A$ and $B$ as "$ARB$ iff there exists a non-singular matrix $P$ such that $PAP^{-1} = B$". Then which of the following is true?

Let $A = {2, 3, 4, 5, ....., 30}$ and '$\simeq$' be an equivalence relation on $A \times A$, defined by $(a, b) \simeq (c, d)$, if and only if $ad = bc$. Then the number of ordered pairs which satisfy this equivalence relation with ordered pair $(4, 3)$ is equal to :