Let $X = {1, 2, 3, 4, 5}$. The number of different ordered pairs $(Y, Z)$ that can be formed such that $Y \subseteq X$, $Z \subseteq X$ and $Y \cap Z$ is empty, is:

Let $$A = \sum\limits_{i = 1}^{10} {\sum\limits_{j = 1}^{10} {\min \,\{ i,j\} } } $$ and $$B = \sum\limits_{i = 1}^{10} {\sum\limits_{j = 1}^{10} {\max \,\{ i,j\} } } $$Then A + B is equal to _____________.

Let $A = {1, 3, 4, 6, 9}$ and $B = {2, 4, 5, 8, 10}$. Let $R$ be a relation defined on $A \times B$ such that $R = {((a_1, b_1), (a_2, b_2)): a_1 \le b_2 \text{ and } b_1 \le a_2}$. Then the number of elements in the set R is :

Let $A=\{1,2,3, \ldots \ldots \ldots \ldots, 100\}$. Let $R$ be a relation on $\mathrm{A}$ defined by $(x, y) \in R$ if and only if $2 x=3 y$. Let $R_1$ be a symmetric relation on $A$ such that $R \subset R_1$ and the number of elements in $R_1$ is $\mathrm{n}$. Then, the minimum value of $\mathrm{n}$ is _________.

Let S = {1, 2, 3, 5, 7, 10, 11}. The number of non-empty subsets of S that have the sum of all elements a multiple of 3, is _____________.