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
reflexive, symmetric
symmetric, transitive
transitive only
equivalence
Show that the number of equivalence relation in the set $\{1,2,3\} $ containing $(1,2)$ and $(2,1)$ is two.
Let $A = \{1, 2, 3, 4\}$ and let $R= \{(2, 2), (3, 3), (4, 4), (1, 2)\}$ be a relation on $A$. Then $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 father of $y\}$
Let $R = \{(a, a)\}$ be a relation on a set $A$. Then $R$ is
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-