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 __________.
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
Consider the relations $R_1$ and $R_2$ defined as $aR_1b \Leftrightarrow a^2 + b^2 = 1$ for all $a, b \in R$ and $(a, b)R_2(c, d) \Leftrightarrow a+ d = b + c$ for all $(a, b), (c, d) \in N \times N$. Then: