MCQ_SINGLE
Consider the following two binary relations on the set $A = {a, b, c}$:
$R_1 = {(c, a), (b, b), (a, c), (c, c), (b, c), (a, a)}$ and
$R_2 = {(a, b), (b, a), (c, c), (c, a), (a, a), (b, b), (a, c)}$.
Then:
MCQ_SINGLE
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 :
NUMERICAL
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 _________.
NUMERICAL
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 _________.