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 $N \times N$ defined by $(a, b) R (c, d)$ if and only if $ad(b - c) = bc(a - d)$. Then $R$ 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 X = {n $ \in $ N : 1 $ \le $ n $ \le $ 50}. If A = {n $ \in $ X: n is a multiple of 2} and B = {n $ \in $ X: n is a multiple of 7}, then the number of elements in the smallest subset of X containing both A and B is ________.

MCQ_SINGLE

Consider the sets $A = \{(x, y) \in R \times R : x^2 + y^2 = 25\}$, $B = \{(x, y) \in R \times R: x^2 + 9y^2 = 144\}$, $C = \{(x, y) \in Z \times Z: x^2 + y^2 \leq 4\}$ and $D = A \cap B$. The total number of one-one functions from the set $D$ to the set $C$ is:

View All Questions