NUMERICAL

For $n \geq 2$, let $S_n$ denote the set of all subsets of $\{1,2, \ldots, n\}$ with no two consecutive numbers. For example $\{1,3,5\} \in S_6$, but $\{1,2,4\} \notin S_6$. Then $n\left(S_5\right)$ is equal to ________

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 __________.

MCQ_SINGLE

For $\alpha \in N$, consider a relation $R$ on $N$ given by $R = \{(x, y) : 3x + \alpha y$ is a multiple of $7\}$. The relation $R$ is an equivalence relation if and only if :

MCQ_SINGLE

The minimum number of elements that must be added to the relation $R = \{(a, b), (b, c)\}$ on the set $\{a, b, c\}$ so that it becomes symmetric and transitive is :

NUMERICAL

5 Let $A=\{2,3,6,7\}$ and $B=\{4,5,6,8\}$. Let $R$ be a relation defined on $A \times B$ by $(a_1, b_1) R(a_2, b_2)$ if and only if $a_1+a_2=b_1+b_2$. Then the number of elements in $R$ is __________.

View All Questions