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=\{1,2,3, \ldots, 20\}$. Let $R_1$ and $R_2$ two relation on $A$ such that $R_1=\{(a, b): b$ is divisible by $a\}$ $R_2=\{(a, b): a$ is an integral multiple of $b\}$. Then, number of elements in $R_1-R_2$ is equal to _____________.

NUMERICAL

Let S = {1, 2, 3, 5, 7, 10, 11}. The number of non-empty subsets of S that have the sum of all elements a multiple of 3, is _____________.

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

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 :

View All Questions