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
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:
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 :