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 :

4 Let $A=\{1,2,3\}$. The number of relations on $A$, containing $(1,2)$ and $(2,3)$, which are reflexive and transitive but not symmetric, is _________.

Let $S = \mathbb{N} \cup \{0\}$. Define a relation R from S to $\mathbb{R}$ by: $R = \{(x, y) : \log_e y = x \log_e (\frac{2}{5}), x \in S, y \in \mathbb{R}\}$. Then, the sum of all the elements in the range of $R$ is equal to:

Set A has m elements and set B has n elements. If the total number of subsets of A is 112 more than the total number of subsets of B, then the value of m.n is ______.

Let $A = {1, 2, 3, …, 10}$ and $B = {\frac{m}{n} : m, n \in A, m < n$ and $gcd(m, n) = 1}$. Then $n(B)$ is equal to :