MCQ_SINGLE

The number of non-empty equivalence relations on the set ${1, 2, 3}$ is :

MCQ_SINGLE

Let $S = {1, 2, 3, …, 10}$. Suppose $M$ is the set of all the subsets of $S$, then the relation $R = {(A, B) : A ∩ B ≠ 𝜙; A, B ∈ M}$ is :

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

MCQ_SINGLE

Let $R = \{(1, 2), (2, 3), (3, 3)\}$ be a relation defined on the set $\{1, 2, 3, 4\}$. Then the minimum number of elements, needed to be added in $R$ so that $R$ becomes an equivalence relation, is:

NUMERICAL

Let A = {n $ \in $ N: n is a 3-digit number} B = {9k + 2: k $ \in $ N} and C = {9k + $l$: k $ \in $ N} for some $l ( 0 < l < 9)$ If the sum of all the elements of the set A $ \cap $ (B $ \cup $ C) is 274 $ \times $ 400, then $l$ is equal to ________.

View All Questions