Let $A = \{x:x \in R,\,|x|\, < 1\}\,;$ $B = \{x:x \in R,\,|x - 1| \ge 1\}$ and $A \cup B = R - D,$then the set $D$ is

If $\mathrm{A}=\{\mathrm{x} \in {R}:|\mathrm{x}-2|>1\}, \mathrm{B}=\left\{\mathrm{x} \in {R}: \sqrt{\mathrm{x}^{2}-3}>1\right\}$, $\mathrm{C}=\{\mathrm{x} \in {R}:|\mathrm{x}-4| \geq 2\}$ and ${Z}$ is the set of all integers, then the number of subsets of the set $(A \cap B \cap C)^{c} \cap {Z}$ is .... .

Let $\bigcup \limits_{i=1}^{50} X_{i}=\bigcup \limits_{i=1}^{n} Y_{i}=T$ where each $X_{i}$ contains $10$ elements and each $Y_{i}$ contains $5$ elements. If each element of the set $T$ is an element of exactly $20$ of sets $X_{i}$ 's and exactly $6$ of sets $Y_{i}$ 's, then $n$ is equal to

$S=\{(x, y, z): x, y, z \in Z, x+2 y+3 z=42$ $\mathrm{x}, \mathrm{y}, \mathrm{z} \geq 0\}$ ...........

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

Let $S$ be the set of all ordered pairs $(x, y)$ of positive integers satisfying the condition $x^2-y^2=12345678$. Then,