NUMERICAL
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 __________.
NUMERICAL
The number of relations, on the set $\{1,2,3\}$ containing $(1,2)$ and $(2,3)$, which are reflexive and transitive but not symmetric, is __________.
MCQ_SINGLE
Let $A = {1, 3, 4, 6, 9}$ and $B = {2, 4, 5, 8, 10}$. Let $R$ be a relation defined on $A \times B$ such that $R = {((a_1, b_1), (a_2, b_2)): a_1 \le b_2 \text{ and } b_1 \le a_2}$. Then the number of elements in the set R is :
MCQ_SINGLE
Let $X = {1, 2, 3, 4, 5}$. The number of different ordered pairs $(Y, Z)$ that can be formed such that $Y \subseteq X$, $Z \subseteq X$ and $Y \cap Z$ is empty, is:
MCQ_SINGLE
Let $A = {1, 2, 3, …, 10}$ and $B = {\frac{m}{n} : m, n \in A, m < n$ and $gcd(m, n) = 1}$. Then $n(B)$ is equal to :