NUMERICAL

Let R1 and R2 be relations on the set {1, 2, ......., 50} such that R1 = {(p, pn) : p is a prime and n $\ge$ 0 is an integer} and R2 = {(p, pn) : p is a prime and n = 0 or 1}. Then, the number of elements in R1 $-$ R2 is _______________.

MCQ_SINGLE

Consider the following relations $R = \{(x, y) | x, y$ are real numbers and $x = wy$ for some rational number $w\}$; $S = \{(\frac{m}{n}, \frac{p}{q}) | m, n, p$ and $q$ are integers such that $n, q \neq 0$ and $qm = pn\}$. Then

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 :

MCQ_SINGLE

The number of non-empty equivalence relations on the set ${1, 2, 3}$ 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 :

View All Questions