Let us say A 1 , A 2 , A 3 , … , A 3 0 are thirty sets containing 6 elements each. While B 1 , B 2 , B 3 , … , B n are n sets containing 3 elements each. Now consider the following;
⋃ k = 1 3 0 A k = μ = ⋃ k = 1 n B k
Such that, each element of μ belongs to exactly 10 elements of A k 's and exactly 9 elements of B k 's, then find the value of n .
Notation : The symbol ∪ denotes set union , and ⋃ k = 1 m X k = X 1 ∪ X 2 ∪ X 3 ∪ ⋯ ∪ X m .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Problem Loading...
Note Loading...
Set Loading...
Firstly, the total number of elements in A k 's = 3 0 × 6 = 1 8 0 , and the total number of elements in B k 's = n × 3 = 3 n . But each element of μ is present in 1 0 elements of A k 's and 9 elements of B k 's, we can say; 1 0 1 8 0 n n = 9 3 n = 1 0 1 8 0 × 3 = 5 4