Let $A = \{-2, -1, 0, 1, 2, 3\}$. Let R be a relation on $A$ defined by $xRy$ if and only if $y = \max\{x, 1\}$. Let $l$ be the number of elements in R. Let $m$ and $n$ be the minimum number of elements required to be added in R to make it reflexive and symmetric relations, respectively. Then $l + m + n$ is equal to

Let $S=\left\{p_1, p_2 \ldots, p_{10}\right\}$ be the set of first ten prime numbers. Let $A=S \cup P$, where $P$ is the set of all possible products of distinct elements of $S$. Then the number of all ordered pairs $(x, y), x \in S$, $y \in A$, such that $x$ divides $y$, 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 _____________.

The minimum number of elements that must be added to the relation R = {(a, b), (b, c), (b, d)} on the set {a, b, c, d} so that it is an equivalence relation, is __________.

The relation $R = \{(a, b) : gcd(a, b) = 1, 2a \neq b, a, b \in Z\}$ is: