Let $R = \{(a, a)\}$ be a relation on a set $A$. Then $R$ is
Symmetric
Antisymmetric
Symmetric and antisymmetric
Neither symmetric nor anti-symmetric
(c) It is obvious.
If $R$ is an equivalence relation on a Set $A$, then $R^{-1}$ is not :-
Let $A=\{0,3,4,6,7,8,9,10\} \quad$ and $R$ be the relation defined on A such that $R =\{( x , y ) \in A \times A : x – y \quad$ is odd positive integer or $x-y=2\}$. The minimum number of elements that must be added to the relation $R$, so that it is a symmetric relation, is equal to $………..$.
Let $R$ be a relation from $A = \{2,3,4,5\}$ to $B = \{3,6,7,10\}$ defined by $R = \{(a,b) |$ $a$ divides $b, a \in A, b \in B\}$, then number of elements in $R^{-1}$ will be-
Given the relation $R = \{(1, 2), (2, 3)\}$ on the set $A = {1, 2, 3}$, the minimum number of ordered pairs which when added to $R$ make it an equivalence relation is
Let $S$ be set of all real numbers ; then on set $S$ relation $R$ defined as $R = \{\ (a, b) : 1 + ab > 0\ \}$ is
Confusing about what to choose? Our team will schedule a demo shortly.