Home
Class 11
MATHS
Suppose A(1),A(2),……,A(20) are twenty se...

Suppose `A_(1),A_(2),……,A_(20)` are twenty sets each having 5 elemennts and `B_(1),B_(2),………..,B_(n)` are n sets each having 2 elements. Let `U_(i=1)^(20)A_(i)=S=U_(f=1)^(n)B_(f)`. If each element of S belong to exactly 10 of the `A_(i)^(')s` and to exactly 4 of the `B_(i)^(')s` then n is
(i) 10
(ii) 20
(iii) 100
(iv) 50

A

10

B

20

C

100

D

50

Text Solution

Verified by Experts

The correct Answer is:
B
Promotional Banner

Topper's Solved these Questions

  • SETS

    ICSE|Exercise MULTIPLE CHOICE QUESTIONS|29 Videos

  • SETS

    ICSE|Exercise EXERCISE 1 (a)|57 Videos

  • SEQUENCES AND SERIES

    ICSE|Exercise MULTIPLE CHOICE QUESTIONS|34 Videos

  • STATISTICS

    ICSE|Exercise CHAPTER TEST |4 Videos

Similar Questions

Explore conceptually related problems

Suppose, A_(1),A_(2),"……..",A_(30) are thirty sets each having 5 elements and B_(1), B_(2), B_(n) sets each with 3 elements, let underset(i=1)overset(30)(uu) A_(i) = underset(j=1)overset(n)(uu) 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

Suppose x_1,x_2,….x_(50) are 50 sets each having 10 elements and Y_1,Y_2,….Y_n are n sets each having 5 elements. Let uu_(i=1)^50 X_i=uu_(i=1)^n Y_i=Z and each element of Z belong to exactly 25 of X_i and exactly 6 of Y_i then value of n is

Suppose A_1,A_2….. A_(30) are thirty sets each having 5 elements and B_1B_2…..B_n are n sets each having 3 elements ,Let overset(30)underset(i=1)bigcupA_1=overset(n)underset(j=1)bigcupB_j=s and each element of S belongs to exactly 10 of the A_1 and exactly 9 of the value of n.

The number of subsets of the set A={a_(1),a_(2), . . .,a_(n)} which contain even number of elements is

Let a_(1),a_(2)…,a_(n) be a non-negative real numbers such that a_(1)+a_(2)+…+a_(n)=m and let S=sum_(iltj) a_(i)a_(j) , then

For any n positive numbers a_(1),a_(2),…,a_(n) such that sum_(i=1)^(n) a_(i)=alpha , the least value of sum_(i=1)^(n) a_(i)^(-1) , is

If A_(1),A_(2),..., A_(100) are sets such that n(A_(i))=i+2,A_(1)subA_(2)subA_(3)...subA_(100)and underset(i=3)overset(100)nnA_(i)=A,then n(A)=

Let A_(1),A_(2),A_(3),…, A_(100) be 100 seta and such that n(A_(1))=i+1and A_(1)subA_(2)subA_(3)sub...A_(100),then underset(i=1)overset(100)UAi contains… elements

Let A = { 1, 2, 3, …….n } , if a_(i) is the minimum element of the set A_(i) , (where A_(i) , denotes the subset of A containing exactly two elements) and X denotes the set of A_(i) 's , then evalute sum_(A_(i)inX) a

If one quarter of all three element subsete of the set A={a_(1),a_(2),a_(3),......,a_(n)} contains the element a_(3) , then n=