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
$R_{1}$ is an equivalence relation but not $R_{2}$
$R_{2}$ is an equivalence relation but not $R_{1}$
both $R_{1}$ and $R_{2}$ are equivalence relations
neither $R_{1}$ nor $R_{2}$ is an equivalence relation
The number of relations $R$ from an $m$-element set $A$ to an $n$-element set $B$ satisfying the condition$\left(a, b_1\right) \in R,\left(a, b_2\right) \in R \Rightarrow b_1=b_2$ for $a \in A, b_1, b_2 \in B$ is
Let $R$ be an equivalence relation on a finite set $A$ having $n$ elements. Then the number of ordered pairs in $R$ is
Determine whether each of the following relations are reflexive, symmetric and transitive:
Relation $R$ in the set $A$ of human beings in a town at a particular time given by
$R =\{(x, y): x$ is exactly $7\,cm $ taller than $y\}$
Show that the number of equivalence relation in the set $\{1,2,3\} $ containing $(1,2)$ and $(2,1)$ is two.
Let $S$ be the set of all real numbers. Then the relation $R = \{(a, b) : 1 + ab > 0\}$ on $S$ is