Class JEE Mathematics Sets, Relations, and Functions Q #1054
KNOWLEDGE BASED
APPLY
4 Marks 2020 JEE Main 2020 (Online) 4th September Evening Slot MCQ SINGLE
Let $\bigcup_{i=1}^{50} X_i = \bigcup_{i=1}^{n} Y_i = T$ where each $X_i$ contains $10$ elements and each $Y_i$ contains $5$ elements. If each element of the set $T$ is an element of exactly $20$ of sets $X_i$'s and exactly $6$ of sets $Y_i$'s, then $n$ is equal to:
(A) $30$
(B) $50$
(C) $15$
(D) $45$
Prev Next
Correct Answer: A
Explanation
$\bigcup_{i=1}^{50} X_i = X_1, X_2,....., X_{50} = 50$ sets. Given each sets having $10$ elements.
So total elements = $50 \times 10$
$\bigcup_{i=1}^{n} Y_i = Y_1, Y_2,....., Y_n = n$ sets. Given each sets having $5$ elements.
So total elements = $5 \times n$
Now each element of set $T$ contains exactly $20$ of sets $X_i$.
So number of effective elements in set $T = \frac{50 \times 10}{20}$
Also each element of set $T$ contains exactly $6$ of sets $Y_i$.
So number of effective elements in set $T = \frac{n \times 5}{6}$
$\therefore \frac{50 \times 10}{20} = \frac{n \times 5}{6}$
$\Rightarrow n = 30$

More from this Chapter

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 $S = {1, 2, 3, … , 100}$. The number of non-empty subsets A of S such that the product of elements in A is even is :
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
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 $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