Let $R$ be a relation on the set $N$ of natural numbers defined by $nRm $$\Leftrightarrow$ $n$ is a factor of $m$ (i.e.,$ n|m$). Then $R$ is

  • A

    Reflexive and symmetric

  • B

    Transitive and symmetric

  • C

    Equivalence

  • D

    Reflexive, transitive but not symmetric

Similar Questions

The relation "congruence modulo $m$" is

Show that the relation $R$ in the set $\{1,2,3\}$ given by $R =\{(1,1),\,(2,2),$ $(3,3)$, $(1,2)$, $(2,3)\}$ is reflexive but neither symmetric nor transitive.

Let $A=\{1,2,3\} .$ Then number of relations containing $(1,2)$ and $(1,3)$ which are reflexive and symmetric but not transitive is

Let $A$ be the non-void set of the children in a family. The relation $'x$ is a brother of $y'$ on $A$ is

Let $R$ be a relation on the set $N$ be defined by $\{(x, y)| x, y \in N, 2x + y = 41\}$. Then $R$ is