MCQ_SINGLE
Let $R = \{(1, 2), (2, 3), (3, 3)\}$ be a relation defined on the set $\{1, 2, 3, 4\}$. Then the minimum number of elements, needed to be added in $R$ so that $R$ becomes an equivalence relation, is:
NUMERICAL
Let $A=\{1,2,3,4,5,6,7\}$. Define $B=\{T \subseteq A$ : either $1 \notin T$ or $2 \in T\}$ and $C=\{T \subseteq A: T$ the sum of all the elements of $T$ is a prime number $\}$. Then the number of elements in the set $B \cup C$ is ________________.
NUMERICAL
Let $S=\{4,6,9\}$ and $T=\{9,10,11, \ldots, 1000\}$. If $A=\left\{a_{1}+a_{2}+\ldots+a_{k}: k \in \mathbf{N}, a_{1}, a_{2}, a_{3}, \ldots, a_{k}\right.$ $\epsilon S\}$, then the sum of all the elements in the set $T-A$ is equal to __________.