MCQ_SINGLE

Consider the following two binary relations on the set $A = {a, b, c}$: $R_1 = {(c, a), (b, b), (a, c), (c, c), (b, c), (a, a)}$ and $R_2 = {(a, b), (b, a), (c, c), (c, a), (a, a), (b, b), (a, c)}$. Then:

NUMERICAL

Let $S=\left\{p_1, p_2 \ldots, p_{10}\right\}$ be the set of first ten prime numbers. Let $A=S \cup P$, where $P$ is the set of all possible products of distinct elements of $S$. Then the number of all ordered pairs $(x, y), x \in S$, $y \in A$, such that $x$ divides $y$, is ________ .

NUMERICAL

Let A = {n $\in$ N : H.C.F. (n, 45) = 1} and Let B = {2k : k $\in$ {1, 2, ......., 100}}. Then the sum of all the elements of A $\cap$ B is ____________.

MCQ_SINGLE

In a school, there are three types of games to be played. Some of the students play two types of games, but none play all the three games. Which Venn diagrams can justify the above statement?

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

View All Questions