Let A = {n $\in$ N : H.C.F. (n, 45) = 1} and Let B = {2k : k $\in$ {1, 2, ......., 100}}. Then the sum of all the elements of A $\cap$ B is ____________.

Consider the relations $R_1$ and $R_2$ defined as $aR_1b \Leftrightarrow a^2 + b^2 = 1$ for all $a, b \in R$ and $(a, b)R_2(c, d) \Leftrightarrow a+ d = b + c$ for all $(a, b), (c, d) \in N \times N$. Then:

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 :

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 $\mathrm{A}=\{1,2,3,4, \ldots ., 10\}$ and $\mathrm{B}=\{0,1,2,3,4\}$. The number of elements in the relation $R=\left\{(a, b) \in A \times A: 2(a-b)^{2}+3(a-b) \in B\right\}$ is ___________.