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 $A=\{0,3,4,6,7,8,9,10\}$ and $R$ be the relation defined on $A$ such that $R=\{(x, y) \in A \times A: x-y$ is odd positive integer or $x-y=2\}$. The minimum number of elements that must be added to the relation $R$, so that it is a symmetric relation, is equal to ____________.
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 relation $R = \{(a, b) : gcd(a, b) = 1, 2a \neq b, a, b \in Z\}$ is:
NUMERICAL
Let $$A = \sum\limits_{i = 1}^{10} {\sum\limits_{j = 1}^{10} {\min \,\{ i,j\} } } $$ and $$B = \sum\limits_{i = 1}^{10} {\sum\limits_{j = 1}^{10} {\max \,\{ i,j\} } } $$Then A + B is equal to _____________.
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