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

NUMERICAL

The number of relations, on the set $\{1,2,3\}$ containing $(1,2)$ and $(2,3)$, which are reflexive and transitive but not symmetric, is __________.

MCQ_SINGLE

Let $R = {(P, Q) | P$ and $Q$ are at the same distance from the origin} be a relation, then the equivalence class of $(1, −1)$ is the set :

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

NUMERICAL

Let $A=\{2,3,6,7\}$ and $B=\{4,5,6,8\}$. Let $R$ be a relation defined on $A \times B$ by $(a_1, b_1) R(a_2, b_2)$ if and only if $a_1+a_2=b_1+b_2$. Then the number of elements in $R$ is __________.

View All Questions