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

The number of non-empty equivalence relations on the set $\{1,2,3\}$ is :

Let $$A=\{2,3,6,8,9,11\}$$ and $$B=\{1,4,5,10,15\}$$. Let $$R$$ be a relation on $$A \times B$$ defined by $$(a, b) R(c, d)$$ if and only if $$3 a d-7 b c$$ is an even integer. Then the relation $$R$$ is

Let $$\mathrm{A}=\{1,2,3,4,5\}$$. Let $$\mathrm{R}$$ be a relation on $$\mathrm{A}$$ defined by $$x \mathrm{R} y$$ if and only if $$4 x \leq 5 \mathrm{y}$$. Let $$\mathrm{m}$$ be the number of elements in $$\mathrm{R}$$ and $$\mathrm{n}$$ be the minimum number of elements from $$\mathrm{A} \times \mathrm{A}$$ that are required to be added to R to make it a symmetric relation. Then m + n is equal to :