Let $N$ be the set of natural numbers greater than $100. $ Define the relation $R$ by : $R = \{(x,y) \in \,N × N :$ the numbers $x$ and $y$ have atleast two common divisors$\}.$ Then $R$ is-

Let $R_{1}$ and $R_{2}$ be two relations defined on $R$ by $a R _{1} b \Leftrightarrow a b \geq 0$ and $a R_{2} b \Leftrightarrow a \geq b$, then

Let $R$ be a reflexive relation on a finite set $A$ having $n$-elements, and let there be m ordered pairs in $R$. Then

Let $X =\{1,2,3,4,5,6,7,8,9\} .$ Let $R _{1}$ be a relation in $X$ given by $R _{1}=\{(x, y): x-y$ is divisible by $3\}$ and $R _{2}$ be another relation on $X$ given by ${R_2} = \{ (x,y):\{ x,y\}  \subset \{ 1,4,7\} \} $ or $\{x, y\} \subset\{2,5,8\} $ or $\{x, y\} \subset\{3,6,9\}\} .$ Show that $R _{1}= R _{2}$.

Let $\mathrm{T}$ be the set of all triangles in a plane with $\mathrm{R}$ a relation in $\mathrm{T}$ given by $\mathrm{R} =\left\{\left( \mathrm{T} _{1}, \mathrm{T} _{2}\right): \mathrm{T} _{1}\right.$ is congruent to $\left. \mathrm{T} _{2}\right\}$ . Show that $\mathrm{R}$ is an equivalence relation.

Let $R= \{(3, 3) (5, 5), (9, 9), (12, 12), (5, 12), (3, 9), (3, 12), (3, 5)\}$ be a relation on the set $A= \{3, 5, 9, 12\}.$ Then, $R$ is