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 ________

MCQ_SINGLE

Let $R$ be a relation on $Z \times Z$ defined by $(a, b)R(c, d)$ if and only if $ad - bc$ is divisible by $5$. Then $R$ is

NUMERICAL

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

NUMERICAL

Let A = {n $\in$ N | n2 $\le$ n + 10,000}, B = {3k + 1 | k$\in$ N} an dC = {2k | k$\in$N}, then the sum of all the elements of the set A $\cap$(B $-$ C) is equal to _____________.

NUMERICAL

Let $\mathrm{A}=\{1,2,3,4, \ldots ., 10\}$ and $\mathrm{B}=\{0,1,2,3,4\}$. The number of elements in the relation $R=\left\{(a, b) \in A \times A: 2(a-b)^{2}+3(a-b) \in B\right\}$ is ___________.

View All Questions