NUMERICAL
Let $A=\{1,2,3,4\}$ and $R=\{(1,2),(2,3),(1,4)\}$ be a relation on $\mathrm{A}$. Let $\mathrm{S}$ be the equivalence relation on $\mathrm{A}$ such that $R \subset S$ and the number of elements in $\mathrm{S}$ is $\mathrm{n}$. Then, the minimum value of $n$ is __________.
NUMERICAL
The number of relations, on the set $\{1,2,3\}$ containing $(1,2)$ and $(2,3)$, which are reflexive and transitive but not symmetric, is __________.
MCQ_SINGLE
Let $A = {0, 1, 2, 3, 4, 5}$. Let $R$ be a relation on $A$ defined by $(x, y) \in R$ if and only if $\max{x, y} \in {3, 4}$. Then among the statements
(S1): The number of elements in $R$ is $18$, and
(S2): The relation $R$ is symmetric but neither reflexive nor transitive
MCQ_SINGLE
Let $A = {2, 3, 4, 5, ....., 30}$ and '$\simeq$' be an equivalence relation on $A \times A$, defined by $(a, b) \simeq (c, d)$, if and only if $ad = bc$. Then the number of ordered pairs which satisfy this equivalence relation with ordered pair $(4, 3)$ is equal to :