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 __________.
MCQ_SINGLE
Let $S = {1, 2, 3, …, 10}$. Suppose $M$ is the set of all the subsets of $S$, then the relation $R = {(A, B) : A ∩ B ≠ 𝜙; A, B ∈ M}$ is :
MCQ_SINGLE
Consider the following two binary relations on the set $A = {a, b, c}$:
$R_1 = {(c, a), (b, b), (a, c), (c, c), (b, c), (a, a)}$ and
$R_2 = {(a, b), (b, a), (c, c), (c, a), (a, a), (b, b), (a, c)}$.
Then:
MCQ_SINGLE
Let $A = {2, 3, 4}$ and $B = {8, 9, 12}$. Then the number of elements in the relation $R = {((a_1, b_1), (a_2, b_2)) \in (A \times B, A \times B) : a_1$ divides $b_2$ and $a_2$ divides $b_1}$ is :