Let $R$ be the set of real numbers. Statement I: $A = \{(x, y) \in R \times R: y - x \text{ is an integer }\}$ is an equivalence relation on $R$. Statement II: $B = \{(x,y) \in R \times R: x = \alpha y \text{ for some rational number } \alpha\}$ is an equivalence relation on $R$.

Let $A = {1, 2, 3, ..., 100}$ and $R$ be a relation on $A$ such that $R = {(a, b) : a = 2b + 1}$. Let $(a_1, a_2), (a_2, a_3), (a_3, a_4), ..., (a_k, a_{k+1})$ be a sequence of $k$ elements of $R$ such that the second entry of an ordered pair is equal to the first entry of the next ordered pair. Then the largest integer k , for which such a sequence exists, is equal to :

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 = {n $ \in $ N: n is a 3-digit number} B = {9k + 2: k $ \in $ N} and C = {9k + $l$: k $ \in $ N} for some $l ( 0 < l < 9)$ If the sum of all the elements of the set A $ \cap $ (B $ \cup $ C) is 274 $ \times $ 400, then $l$ is equal to ________.

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 _________.