Given the relation $R = \{(1, 2), (2, 3)\}$ on the set $A = {1, 2, 3}$, the minimum number of ordered pairs which when added to $R$ make it an equivalence relation is

Let $R_{1}$ and $R_{2}$ be relations on the set $\{1,2, \ldots, 50\}$ such that $R _{1}=\left\{\left( p , p ^{ n }\right)\right.$ : $p$ is a prime and $n \geq 0$ is an integer $\}$ and $R _{2}=\left\{\left( p , p ^{ n }\right)\right.$ : $p$ is a prime and $n =0$ or $1\}$. Then, the number of elements in $R _{1}- R _{2}$ is……..

Consider the following two binary relations on the set $A= \{a, b, c\}$ : $R_1 = \{(c, a) (b, b) , (a, c), (c,c), (b, c), (a, a)\}$ and $R_2 = \{(a, b), (b, a), (c, c), (c,a), (a, a), (b, b), (a, c)\}.$ Then

Give an example of a relation. Which is Reflexive and transitive but not symmetric.

Let $\mathrm{A}$ be the set of all students of a boys school. Show that the relation $\mathrm{R}$ in A given by $\mathrm{R} =\{(a, b): \mathrm{a} $ is sister of $\mathrm{b}\}$ is the empty relation and $\mathrm{R} ^{\prime}=\{(a, b)$ $:$ the difference between heights of $\mathrm{a}$ and $\mathrm{b}$ is less than $3\,\mathrm{meters}$ $\}$ is the universal relation.