Let $R$ be a relation defined on $N \times N$ by $(a, b) R(c, d) \Leftrightarrow  a(b + c) = c(a + d).$ Then $R$ is

Determine whether each of the following relations are reflexive, symmetric and transitive:

Relation $\mathrm{R}$ in the set $\mathrm{A}=\{1,2,3,4,5,6\}$ as $\mathrm{R} =\{(\mathrm{x}, \mathrm{y}): \mathrm{y}$ is divisible by $\mathrm{x}\}$

If $\mathrm{R}$ is the smallest equivalence relation on the set $\{1,2,3,4\}$ such that $\{(1,2),(1,3)\} \subset R$, then the number of elements in $\mathrm{R}$ is

Let $N$ denote the set of all natural numbers. Define two binary relations on $N$ as $R_1 = \{(x,y) \in  N \times  N : 2x + y= 10\}$ and $R_2 = \{(x,y) \in  N\times  N : x+ 2y= 10\} $. Then

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