Class JEE Mathematics Sets, Relations, and Functions Q #1070
KNOWLEDGE BASED
APPLY
4 Marks 2012 AIEEE 2012 MCQ SINGLE
Let $X = {1, 2, 3, 4, 5}$. The number of different ordered pairs $(Y, Z)$ that can be formed such that $Y \subseteq X$, $Z \subseteq X$ and $Y \cap Z$ is empty, is:
(A) $3^5$
(B) $2^5$
(C) $5^3$
(D) $5^2$
Prev Next
Correct Answer: A
Explanation
For any element $x_i$ present in $X$, 4 cases arise while making subsets $Y$ and $Z$.

Case 1: $x_i \in Y, x_i \in Z \implies Y \cap Z \neq \emptyset$

Case 2: $x_i \in Y, x_i \notin Z \implies Y \cap Z = \emptyset$

Case 3: $x_i \notin Y, x_i \in Z \implies Y \cap Z = \emptyset$

Case 4: $x_i \notin Y, x_i \notin Z \implies Y \cap Z = \emptyset$

Therefore, for every element, the number of ways is $3$ for which $Y \cap Z = \emptyset$.

Thus, the total number of ways is $3 \times 3 \times 3 \times 3 \times 3 = 3^5$ since the number of elements in set $X$ is $5$.

More from this Chapter

MCQ_SINGLE
Consider the relations $R_1$ and $R_2$ defined as $aR_1b \Leftrightarrow a^2 + b^2 = 1$ for all $a, b \in R$ and $(a, b)R_2(c, d) \Leftrightarrow a+ d = b + c$ for all $(a, b), (c, d) \in N \times N$. Then:
NUMERICAL
Let $A=\{1,2,3,4\}$ and $R=\{(1,2),(2,3),(1,4)\}$ be a relation on $\mathrm{A}$. Let $\mathrm{S}$ be the equivalence relation on $\mathrm{A}$ such that $R \subset S$ and the number of elements in $\mathrm{S}$ is $\mathrm{n}$. Then, the minimum value of $n$ is __________.
MCQ_SINGLE
The minimum number of elements that must be added to the relation $R = \{(a, b), (b, c)\}$ on the set $\{a, b, c\}$ so that it becomes symmetric and transitive is :
NUMERICAL
Let $A=\{1,2,3,4,5,6,7\}$ and $B=\{3,6,7,9\}$. Then the number of elements in the set $\{C \subseteq A: C \cap B \neq \phi\}$ is ___________.
MCQ_SINGLE
Let $A = {1, 2, 3, ..., 100}$ and $R$ be a relation on $A$ such that $R = {(a, b) : a = 2b + 1}$. Let $(a_1, a_2), (a_2, a_3), (a_3, a_4), ..., (a_k, a_{k+1})$ be a sequence of $k$ elements of $R$ such that the second entry of an ordered pair is equal to the first entry of the next ordered pair. Then the largest integer k , for which such a sequence exists, is equal to :
View All Questions