If $R \subset A \times B$ and $S \subset B \times C\,$ be two relations, then ${(SoR)^{ - 1}} = $
${S^{ - 1}}o{R^{ - 1}}$
${R^{ - 1}}o{S^{ - 1}}$
$SoR$
$RoS$
(b) It is obvious.
$A$ relation $R$ is defined from $\{2, 3, 4, 5\}$ to $\{3, 6, 7, 10\}$ by $xRy \Leftrightarrow x$ is relatively prime to $y$. Then domain of $R$ is
Let $A=\{1,2,3,4\}$ and $R$ be a relation on the set $A \times A$ defined by $R=\{((a, b),(c, d)): 2 a+3 b=4 c+5 d\}$. Then the number of elements in $R$ is:
The minimum number of elements that must be added to the relation $R =\{( a , b ),( b , c )$, (b, d) $\}$ on the set $\{a, b, c, d\}$ so that it is an equivalence relation, is $………$
Show that the number of equivalence relation in the set $\{1,2,3\} $ containing $(1,2)$ and $(2,1)$ is two.
In order that a relation $R$ defined on a non-empty set $A$ is an equivalence relation, it is sufficient, if $R$
Confusing about what to choose? Our team will schedule a demo shortly.
