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

MCQ_SINGLE

Let $A = {2, 3, 4}$ and $B = {8, 9, 12}$. Then the number of elements in the relation $R = {((a_1, b_1), (a_2, b_2)) \in (A \times B, A \times B) : a_1$ divides $b_2$ and $a_2$ divides $b_1}$ is :

MCQ_SINGLE

Let $A = {1, 3, 4, 6, 9}$ and $B = {2, 4, 5, 8, 10}$. Let $R$ be a relation defined on $A \times B$ such that $R = {((a_1, b_1), (a_2, b_2)): a_1 \le b_2 \text{ and } b_1 \le a_2}$. Then the number of elements in the set R is :

MCQ_SINGLE

Let $\bigcup_{i=1}^{50} X_i = \bigcup_{i=1}^{n} Y_i = T$ where each $X_i$ contains $10$ elements and each $Y_i$ contains $5$ elements. If each element of the set $T$ is an element of exactly $20$ of sets $X_i$'s and exactly $6$ of sets $Y_i$'s, then $n$ is equal to:

MCQ_SINGLE

Let $A = {2, 3, 4, 5, ....., 30}$ and '$\simeq$' be an equivalence relation on $A \times A$, defined by $(a, b) \simeq (c, d)$, if and only if $ad = bc$. Then the number of ordered pairs which satisfy this equivalence relation with ordered pair $(4, 3)$ is equal to :

View All Questions