The number of words, which can be formed using all the letters of the word "DAUGHTER", so that all the vowels never come together, is

The number of elements in the set $S = \left\{(r, k) : k \in \mathbb{Z} \text{ and } {}^{36}C_{r+1} = \dfrac{6\left({}^{35}C_r\right)}{(k^2 - 3)}\right\}$, is :

Suppose $\mathrm{a}, \mathrm{b}, \mathrm{c}$ are in A.P. and $\mathrm{a}^{2}, 2 \mathrm{~b}^{2}, \mathrm{c}^{2}$ are in G.P. If $\mathrm{a}<\mathrm{b}<\mathrm{c}$ and $\mathrm{a}+\mathrm{b}+\mathrm{c}=1$, then $9\left(\mathrm{a}^{2}+\mathrm{b}^{2}+\mathrm{c}^{2}\right)$ is equal to $\_\_\_\_$ .

Let $S=\left\{z \in \mathbb{C}: 4 z^{2}+\bar{z}=0\right\}$. Then $\sum_{z \in S}|z|^{2}$ is equal to:

Let $S=\{z: 3 \leqslant|2 z-3(1+i)| \leqslant 7\}$ be a set of complex numbers. Then $\min _{z \in S}\left|\left(z+\frac{1}{2}(5+3 i)\right)\right|$ is equal to :

Let $A = \begin{bmatrix} 1 & 0 & 0 \\ 3 & 1 & 0 \\ 9 & 3 & 1 \end{bmatrix}$ and $B = [b_{ij}]$, $1 \leq i, j \leq 3$. If $B = A^{99} - I$, then the value of $\dfrac{b_{31} - b_{21}}{b_{32}}$ is :