If ${A_1}, {A_2}, {A_3}, \dots, {A_{30}}$ are $30$ sets each having $5$ elements and ${B_1}, {B_2}, \dots, {B_n}$ are $n$ sets each having $3$ elements. Let $\bigcup_{i=1}^{30} {A_i} = \bigcup_{j=1}^n {B_j} = S$ and each element of $S$ belongs to exactly $10$ of the $A_i$'s and exactly $9$ of the $B_j$'s,then $n$ is equal to:

  • A
    $15$
  • B
    $3$
  • C
    $45$
  • D
    None of these

Explore More

Similar Questions

If sets $A$ and $B$ have $3$ and $6$ elements respectively,what is the minimum number of elements in $A \cup B$?

Let $A = \{a_1, a_2, a_3, \dots, a_n\}$ be a set containing $n$ elements. Two subsets $P$ and $Q$ of $A$ are formed independently. The number of ways in which these subsets can be formed such that $(P - Q)$ contains exactly $2$ elements is:

$a, b, c, d, e, f, g, h$ are distinct elements in the set $\{-7, -5, -3, -2, 2, 4, 6, 13\}$. The minimum value of $(a+b+c+d)^2+(e+f+g+h)^2$ is

Let $S = \{1, 2, 3, \ldots, 40\}$ and let $A$ be a subset of $S$ such that no two elements in $A$ have their sum divisible by $5$. What is the maximum number of elements possible in $A$?

Let $A = \{x : |x^{2} - 10| \le 6\}$ and $B = \{x : |x - 2| > 1\}$. Then:

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo