NUMERICAL
Let $\mathrm{A}=\{-4,-3,-2,0,1,3,4\}$ and $\mathrm{R}=\left\{(a, b) \in \mathrm{A} \times \mathrm{A}: b=|a|\right.$ or $\left.b^{2}=a+1\right\}$ be a relation on $\mathrm{A}$. Then the minimum number of elements, that must be added to the relation $\mathrm{R}$ so that it becomes reflexive and symmetric, is __________
MCQ_SINGLE
Let $R = \{(3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3, 9), (3, 12), (3, 6)\}$ be a relation on the set $A = \{3, 6, 9, 12\}$. The relation is :
MCQ_SINGLE
Let $A = {1, 2, 3, ..., 100}$ and $R$ be a relation on $A$ such that $R = {(a, b) : a = 2b + 1}$. Let $(a_1, a_2), (a_2, a_3), (a_3, a_4), ..., (a_k, a_{k+1})$ be a sequence of $k$ elements of $R$ such that the second entry of an ordered pair is equal to the first entry of the next ordered pair. Then the largest integer k , for which such a sequence exists, is equal to :
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 :