Let $S=\{1,2,3, \ldots \ldots, n\}$ and $A=\{(a, b) \mid 1 \leq$ $a, b \leq n\}=S \times S$. A subset $B$ of $A$ is said to be a good subset if $(x, x) \in B$ for every $x \in S$. Then, the number of good subsets of $A$ is

If $\mathrm{S}=\{\mathrm{a} \in \mathrm{R}:|2 \mathrm{a}-1|=3[\mathrm{a}]+2\{\mathrm{a}\}\}$, where $[\mathrm{t}]$ denotes the greatest integer less than or equal to $t$ and $\{t\}$ represents the fractional part of $t$, then $72 \sum_{\mathrm{a} \in \mathrm{S}} \mathrm{a}$ is equal to....................

Let $A=\{n \in N: H . C . F .(n, 45)=1\}$ and Let $B=\{2 k: k \in\{1,2, \ldots, 100\}\}$. Then the sum of all the elements of $A \cap B$ is

Suppose ${A_1},\,{A_2},\,{A_3},........,{A_{30}}$ are thirty sets each having $5$ elements and ${B_1},\,{B_2}, ......., B_n$ are $n$ sets each with $3$ elements. Let $\bigcup\limits_{i = 1}^{30} {{A_i}} = \bigcup\limits_{j = 1}^n {{B_j}} = S$ and each elements of $S$ belongs to exactly $10$ of the $A_i's$ and exactly $9$ of the $B_j's$. Then $n$ is equal to

Let $\mathrm{A}=\{\mathrm{n} \in[100,700] \cap \mathrm{N}: \mathrm{n}$ is neither a multiple of $3$ nor a multiple of 4$\}$. Then the number of elements in $\mathrm{A}$ is

Let $S=\{4,6,9\}$ and $T=\{9,10,11, \ldots, 1000\}$. If

$A=\left\{a_{1}+a_{2}+\ldots+a_{k}: k \in N, a_{1}, a_{2}, a_{3}, \ldots, a_{k} \in S\right\}$ then the sum of all the elements in the set $T - A$ is equal to $......$