www.inpsmcalucknow.

com
INPS CLASSES MATERIAL 1 SET THEORY

SET THEORY 1. The set of all real numbers whose square is -1.
2. The set of all rational numbers whose square is 2.
3. The set of all those integers that are both even and
SY NOPS IS odd.
FUNDAMENTAL CONCEPTS A set consisting of atleast one element is called
 SET: A set is a well defined collection of a non-empty set.
objects. That is for a given object, it is possible  Singleton Set :
to determine, whether that object belongs to the A set having only one element is called singleton
given collection or not. set.
 Notations: The sets are usually denoted by For example, {0} is a singleton set, whose only
capital letters A, B, C, etc. and the members or member is 0.
elements of the set are denoted by lower-case  Finite and Infinite Set :
letters a, b, c, etc. If x is a member of the set A, A set which has finite number of elements is
we write x  A (read as x belongs to A) and if x called a finite set. Otherwise, it is called an infinite
is not a member of the set A, we write x  A set.
(read as x does not belong to A). If x and y both For example, the set of all days in a week is a
belong to A, we write x, y  A. finite set whereas, the set of all integers, denoted
by {....., -2, -1, 0, 1, 2, .....} or {x | x is an integer},
 Representatation of a Set : is an infinite set.
Usually, sets are represented in the following two An empty set  which has no element, is a
ways. finite set.
1. Roster form or Tabular form.  Cardinal Number:
2. Set Builder form or Rule Method. The number of distinct elements in a finite set A
 Roster Form : is called the cardinal number of the set A and it
In this form, we list all the members of the set is denoted by n(A).
within braces (curly brackets) and separate these  Equal Sets :
by commas. Two sets A and B are said to be equal, written as
For example, the set A of all odd natural numbers A=B, if every element of A is in B and every
less than 10 in the roster form is written as : element of B is in A.
A = {1, 3, 5, 7, 9}  Equivalent Sets :
 Note : Two finite sets A and B are said to be equivalent,
1) In roster form, every element of the set is listed if n(A)=n(B).
only once. Clearly, equal sets are equivalent but equivalent
2) The order in which the elements are listed is sets need not be equal.
immaterial. For example, the sets A={4, 5, 3, 2} and B={1,
For example, each of the following sets denotes 6, 8, 9} are equivalent but are not equal.
the same set {1, 2, 3}, {3, 2, 1}, {1, 3, 2}.  Subset :
 Set - Builder Form : Let A and B be two sets. If every element of A is
In this form, we write a variable (say x) an element of B, then A is called a subset of B
representing any member of the set followed by
and we write A  B or B  A (read as A is
a property satisfied by each member of the set.
For example, the set A of all prime numbers less contained in B or B contains A). B is called
than 10 in the set-builder form is written as superset of A.
A = {x | x is a prime number less than 10}  Notes :
The symbol '|' stands for the words 'such that'. 1) If A  B and A  B , we write A  B or
Sometimes, we use the symbol ':' in place of the
B  A (read as : A is a proper subset of B or B
symbol '|'. is a proper superset of A).
Types of Sets : 2) Every set is a subset and a superset of itself.
 Empty Set or Null Set :
3) If A is not a subset of B, we write .
A set which has no element is called the null set
4) The empty set is the subset of every set.
or empty set. It is denoted by the symbol  . 5) If A is a set with n(A)=m, then the number of
For example, each of the following is a null set :
www.inpsmcalucknow.com
INPS CLASSES MATERIAL 2 SET THEORY

subsets of A are 2m and the number of proper A  B  x : x  A and x  B

subsets of A are 2m  1 .
Similarly, B  A   x : x  B and x  A
 Power Set :
The set of all subsets of a given set A is called For example, if A={1, 2, 3, 4} and B={1, 3, 5, 7,
the power set of A and is denoted by P(A). 9}, then A-B={2, 4} and B-A={7, 9}.
For example, if A={1, 2, 3}, then  Important Results :
1. A  B  B  A
P(A)={  , {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2,
3}}. 2. The sets A-B, B-A and A  B are disjoint
Clearly, if A has n elements, then its power set sets.
3. A  B  A and B  A  B
P(A) contains exactly 2n elements.
 Operations on Sets : 4. A    A and A  A  
 Union of Two Sets :  Symmetric Difference of Two sets :
The union of two sets A and B, written as A  B The symmetric difference of two sets A and B,
(read as A union B), is the set consisting of all denoted by AB , is defined as
the elements which are either in A or in B or in
AB   A  B    B  A  .
both. Thus,
For example, if A={1, 2, 3, 4, 5} and
A  B  x : x  A or x  B B={1, 3, 5, 7, 9} then
Clearly, x  A  B  x  A or x  B , and AB   A  B   B  A 
x  A  B  x  A and x  B .
 2, 4  7,9
For example, if A={a, b, c, d} and B={c, d, e, f},
then A  B ={a, b, c, d, e, f}.  2, 4, 7,9
 Intersection of Two Sets :
 Complement of a Set :
The intersection of two sets A and B, written as
If U is a universal set and A is a subset of U, then
A  B (read as A intersection B) is the set the complement of A is the set which contains
consisting of all the common elements of A and those elements of U, which are not contained in
B. Thus,
A and is denoted by A' or Ac . Thus,
A  B  x : x  A and x  B
A '  x : x  U and x  A
Clearly, x  A  B  x  A and x  B
For example, if U={1, 2, 3, 4, .........} and A={2,
x  A  B  x  A or x  B . 4, 6, 8, .......}, then, A'={1, 3, 5, 7, ......}.
For example, if A={a, b, c, d} and B={c, d, e, f}  Important Results :
then A  B ={c, d}. a) U '  
 Disjoint Sets :
b)  '  U
Two sets A and B are said to be disjoint, if
A  B   , i.e., A and B have no element in c) AA'  U
common. d) A  A '  
For example, if A={1, 2, 5} and B={4, 6}, then  ALGEBRA OF SETS :
A  B   , so A and B are disjoint sets.  Idempotent Laws :
 Difference of Two Sets : For any set A, we have
If A and B are two sets, then their difference A - B a) A  A  A b) A  A  A
 Identity Laws :
A For any set A, U is universal set, we have
or A \ B (or) is defined as :
B a) A    A b) A    
c) AU  U d) AU  A
www.inpsmcalucknow.com
INPS CLASSES MATERIAL 3 SET THEORY

 Commutative Laws :
For any two sets A and B, we have  A   A  B  A  B
a) A  B  B  A b) A  B  B  A  AB BA  A  B
 Associative Laws :
 AB  AB  A  B
For any three sets A, B and C, we have
a) A   B  C    A  B   C  A   BC    A  B    A  C 
Some Basic Results about Cardinal Number
b) A   B  C    A  B   C If A, B and C are finite sets and U be the finite
 Distributive Laws : universal set, then
For any three sets A, B and C, we have
a) A   B  C    A  B    A  C 
  
n A'  n  U   n  A 

 n  A  B   n  A   n  B  n  A  B 
b) A   B  C    A  B    A  C 
 For any two sets A and B, we have  n  A  B   n  A   n  B  , where A and B are
a) P  A   P  B   P  A  B  disjoint non-empty sets

b) P  A   P  B   P  A  B  , where P  A 
  
n A  B'  n  A   n  A  B
is the power set of A.
'

' '
 '
 n A  B  n  A  B   n  U   n  A  B 
   =A
If A is any set, A
'

 n  A  B   n  A  B   n  U   n  A  B 
' ' '
 Demorgan's Law's for any three sets A, B and C

a)  A  B'  A'  B'  n  A  B  n  A   n  A  B

'
b)  A  B   A '  B'
'
 '
 n  A  B   n  A  B   n A  B  n A  B   
c) A   B  C    A  B    A  C   n  A  B  C   n  A   n  B  n  C  
 n  A  B  n  B  C   n  C  A   n  A  B  C 
d) A   B  C    A  B    A  C 
Key Results on Operations on Sets  If A1 , A 2 , A 3 ............. A n are disjoint sets,
 A  AB , B AB , AB  A , then n  A1  A 2  A3  ...........  A n 
AB B
= n  A1   n  A 2   n  A3   ....  n  A n 
 A  B  A  B'
 n  AB  = number of elements which belong
  A  B  B  A  B
to exactly one of A or B.
  A  B  B   CARTESIAN PRODUCT OF TWO SETS
If A and B are any two non-empty sets, then
 A  B  B'  A ' cartesian product of A and B is defined as
A  B   a, b  : a  A & b  B
 A  B  B'  A'
 Notes
  A  B   A  B   A '
* If A   or B   , then we define A  B   .
* A B  B A
 A  B   A  B   B  A    A  B  * If A has n elements and B has m elements then
A  B has mn elements.
www.inpsmcalucknow.com
INPS CLASSES MATERIAL 4 SET THEORY

* If A1 , A 2 , A 3 .... A P are p non-empty sets, 3. If n  U   700 , n  A   200 , n  B   300 ,

then their cartesian product, is defined as
p
 Ai   a1 , a 2 , a 3 , ..............a p  ; ai  Ai for
'
'
n  A  B   100 , then n A  B is equal
i 1 to
1) 400 2) 240 3) 300 4) 500
all i .
4. In a committee 50 people speak French, 20
Key Results on Cartesian Product speak Spanish and 10 speak both Spanish and
If A, B, C are three sets, then French. The number of persons speaking at least
one of these two languages is
 A   B  C    A  B   A  C 
1) 60 2) 40 3) 38 4) 58
 A   B  C    A  B   A  C  5. If
2
f : R  R , defined by f  x   x  1 , then
 A   B  C    A  B   A  C  the v alues of f 1 17  and f 1  3 
  A  B  S  T    A  S   B  T  where respectively are
S and T are two sets. 1) , 4,  4 2) 3,  3 , 
 If A  B , then  A  C    B  C  .
3) , 3,  3 4) 4,  4 , 

 If A  B , then  AB  BA  AA 6. If sets A and B are defined as

 If A  B and C  D , then A  C  B  D A  x, y  : y  ex , x  R
 If A  B , then A  A   A  B    B  A  B   x, y  : y  x, x  R  , then
 If A and B are two non-empty sets having n
1) B  A 2) A  B
elements in common, then A  B and B  A
3) A  B   4) A  B  A
have n 2 elements in common.
 7. If A  2,3, 4,8,10 , B  3, 4,5,10,12 ,
A  B  B  A if and only if A  B .
' C  4,5, 6,12,14 then
  
A  B'  C'   A  B    A  C 
 A  B   A  C
'
  
A  B'  C'   A  B    A  C  1) 2,3, 4,5,8,10,12 2) 2, 4,8,10,12

3) 3,8,10,12 4) 2,8,10
LEVEL - I
MODEL QUESTIONS A
1. Let A be a non-empty set such that A  A has
8. If A  1, 2,3, 4,5, 6 , B  1, 2 , then  A 
9 elements among which are found (-1, 0) and  
(0, 1), then B
is equal to
1) A  1, 0 2) A  0,1
1) A 2) B' 3) A  B 4) A  B
3) A  1, 0,1 4) A  1,1 9. Of the members of three athletic teams in a
school 21 are in the cricket team, 26 are in the
2. Two finite sets have m and n elements, then total hockey team and 29 are in the football team.
number of subsets of the first set is 56 more Among them, 14 play hockey and cricket, 15
than that the total number of subsets of the play hockey and foot ball, and 12 play foot ball
second. The values of m and n are. and cricket. Eight play all the three games. The
1) 7, 6 2) 6, 3 3) 5, 1 4) 8, 7
www.inpsmcalucknow.com
INPS CLASSES MATERIAL 5 SET THEORY

total number of members in the three athletic

18. If A={x|x is a letter in the word "ACCOUNTANCY"}
teams is then cardinality of A is
1) 43 2) 76 3) 49 4) 53 1) 5 2) 6 3) 7 4) 8
10. Let A and B be two sets such that A  B  A .
19. If n(A)=50, n(B)=20 and n  A  B   10 then
Then A  B is equal to
1)  2) B 3) A 4) A  B n  AB is
11. The smallest set A such that 1) 50 2) 60 3) 70 4) 40
20. Let n(A-B)=25+x, n(B-A)=2x and
A  1, 2  1, 2, 3,5,9 is
n  A  B  2x . If n(A)=2(n(B)) then 'x' is
1) 2,3,5 2) 3,5,9 1) 4 2) 5 3) 6 4) 7
21. If n( )  60, n(A)  21, n(B)  43 then
3) 1, 2,5,9 4) 1, 2
Greatest value of n  A  B  and Least value of
12. If sets A and B have 3 and 6 elements each,
then the minimum number of elements in n  A  B  are
A  B is 1) 60, 43 2) 50, 36 3) 70, 44 4) 60, 38
1) 3 2) 6 3) 9 4) 18 22. If the set of factors of a whole number 'n' including
13. Which of the following is not correct? 'n' itself but not '1' is denoted by
1) A  A c if and only if A   F  n  , F 16   F  40   F  X  then 'x' is
1) 4 2) 8 3) 6 4) 10
2) A c  A if and only if A  X , where X is a
universal set 23.  C
 C

If n A  B  5, n B  A  6 , 
3) If A  B  A  C , then B = C
n  A  B   4 then the value of n  A  B  is
4) A = B is equivalent to A  C  B  C and 1) 18 2) 15 3) 16 4) 17
AC  BC 24. If n     48, n(A)  28, n(B)  33 and
c
14. If X and Y are two sets, X   Y  X  equals
n  B  A   12 , then n  A  BC is
1) X 2) Y 3)  4) X  Y 1) 27 2) 28 3) 29 4) 30
15. Let F1 be the set of all parallelograms, F2 the
PRACTICE QUESTIONS
set of rectangles, F3 the set of rhombuses, F4
25. If aN  ax : x  N , then 3N  7N 
the set of squares and F5 the set of trapeziums 1) 3N 2) 7N 3) N 4) 21 N
26. In a group of 70 people, 37 like coffee, 52 like
in a plane then F1 is equal to tea and each person like atleast one of the two
drinks. The number of persons liking both coffee
1) F2  F3 2) F2  F3  F4  F1
and tea is
3) F3  F4 4) F3  F1 1) 16 2) 13 3) 19 4) 20
27. Let A and B be subsets of a set X. Then
16. Let A  1, 2,3, 4 and B  2,3, 4,5, 6 , A A
1)  AB 2)  AB
then AB is equal to B B
1) 2,3, 4 2) 1 3) 5, 6 4) 1,5, 6 A A
3)  Ac  B 4)  A  Bc
17. The group of beautiful girl is B B
1) a null set 2) a finite set
3) a singlton set 4) not a set
www.inpsmcalucknow.com
INPS CLASSES MATERIAL 6 SET THEORY

c 36. Suppose A1, A 2 ,.................A 30 are thirty

28. The set A  B c
   B  C  is equal to sets each hav ing 5 elements and

1) Ac  B  C
B1, B2 ,...........Bn are n sets each with 3
2) Ac  B
30 n
3) A c  C c 4) A  B'
elements, let  Ai   B j  S and each
29. If A is the set of the divisors of the number 15, B i1 j1
is the set of prime numbers smaller than 10 and
C is the set of even numbers smaller than 9, element of S belongs to exactly 10 of the Ai 'S
then  A  C   B is the set '
and exactly 9 of the B j S . Then n is equal to
1) {1, 3, 5} 2) {1, 2, 3} 1) 15 2) 3 3) 45 4) 50
3) {2, 3, 5} 4) {2, 5} 37. The set

30. If  
A  x : x 2  1 and B  x : x 4  1 , then   A  B  C    A  Bc  C c c
  Cc is
equal to
AB is equal to
1) Bc  Cc 2) AC
1) i,  i 2) 1,1 c
3) B  C 4) C  C C
38. In a mathematics class, 20 children had
3) 1,1,i,  i 4) 1,i
forgotten their rulers and 17 had forgotten their
31. If n()  60, n(A)  21, n(B)  43 then pencils, "Go and borrow them from someone
at once", said the teacher, 24 children left the
Least value of n  A  B  and Greatest value of room, then how many children had forgotten
both is
n  A  B  are 1) 11 2) 12 3) 13 4) 14
1) 2, 31 2) 3, 36 3) 1, 24 4) 4, 21
32. If A={1, 2, 3, 4, 5, 6, 7} then number of proper PRACTICE QUESTIONS
subsets of A is 39. Let A and B be two sets then
1) 7
2 2) 6
2 3) 7
2 1 4) 8
2 1  A  B '   A'  B is equal to
33. If A  B , n(A)=6, n(B)=10 then the value of n(B-
A) is
1) 2 2) 4 3) 6 4) 8
1) A' 2) A

34. If n(P)=25 & n  P  Q   5 then the value of 3) B' 4) A  A '

40. Let U be the univ ersal set and
n  P  Q  is
1) 10 2) 15 3) 20 4) 25 A  B  C  U . Then

 A  B   B  C    C  A ' is equal to
LEVEL - II 1) 2) A   B  C 
ABC
MODEL QUESTIONS
3) ABC 4) A   B  C 
35. If n  A   number of elements in A  n  B 
then 41. 
If n  A   23, n A  B  C
C
  6,
1) n  A ~ B   n  B ~ A 
n  A  C  BC   9, n  A  CC  BC   3
2) n  A  B   n  A   n  B 
then the value of n  A  B  C  is
3) n  A  B   n  B   n  A ~ B 
1) 4 2) 5 3) 6 4) 7
4) None of these
www.inpsmcalucknow.com
INPS CLASSES MATERIAL 7 SET THEORY

42. In a beauty contest, half the number of experts

voted for Miss. A and two thirds voted for Miss PRACTICE QUESTIONS
B, 10 voted for both and '6' did not vote for either. 49. Out of 800 boys in a school. 224 played cricket,
Then how many experts were there in all is 240 played hockey and 336 played basket ball.
1) 20 2) 24 3) 22 4) 26 of the total 64 played both basket ball and
hockey; 80 played cricket and basket ball and
LEVEL - III 40 played cricket and hockey, 24 played all the
three games. The number of boys who did not
MODEL QUESTIONS play in any game is
1) 128 2) 216 3) 240 4) 160
43. n
If X  8  7n  1/ n  N and  50. The set of intelligent students in a class is
1) a null set 2) a singleton set
Y  49  n  1 / n  N , then 3) a finite set
4) not a well defined collection
1) X  Y 2) Y  X 51. In a certain twon 25% families own a phone and
15% own a car, 65% families own neither a phone
3) X  Y 4) X  Y nor a car. 2000 families own both a car and a
44. Let R be set of points inside a rectangle of sides phone. Consider the following statements in this
regrad.
a and b  a, b  1 with two sides along the I) 10% families own both a car and a phone
positive direction of x- axis and y-axis and C be II) 35% families own either a car a phone
the set of points inside a unit circle centred at III) 40,000 families live in the town.
origin, then Which of the above statements are correct
1) I & II 2) I & III
1) R   x, y  : 0  x  a, 0  y  b 52.
3) II and III 4) I, II & III
In a battle 70% of the combatants lost one eye,
2) R   x, y  : 0  x  a, 0  y  b 80% an ear, 75% an arm, 85% a leg, x% lost all
of four limbs. The minimum value of x is
1) 10 2) 12 3) 15 4) 11
3) C  x, y  : x 2  y2  1
4) R  C  R
KEY
45. How many three digit numbers have at least one LEVEL -I
2 and at least one 3 is 1) 3 2) 2 3) 3 4) 1 5) 4
1) 52 2) 48 3) 54 4) 46 6) 3 7) 1 8) 3 9) 1 10) 2
46. If X is a finite set. Let P(X) denote the set of all 11) 2 12) 2 13) 3 14) 3 15) 2
subsets of X and let n(X) denote the number of 16) 4 17) 4 18) 3 19) 1 20) 2
elements in X. If for two finite subsets A, B, 21) 1 22) 2 23) 2 24) 1 25) 4
n(P(A)) = n(P(B))+15 then n(B) = ........., 26) 3 27) 4 28) 2 29) 3 30) 1
n(A)=........... 31) 4 32) 3 33) 2 34) 3
1) 6, 2 2) 8, 4 3) 0, 4 4) 0, 1
47. In a city, three daily newspapers A, B, C are
published. 42% of the people in that city read A, LEVEL - II
51% read B and 68% read C. 30% read A and B; 35) 1 36) 3 37) 3 38) 3 39) 1
28% read B and C; 36% read A and C; 8% do 40) 3 41) 5 42) 2
not read any of the three newspapers. The
percentage of persons who read all the three LEVEL- III
papers is 43) 1 44) 2 45) 1 46) 3 47) 1
1) 25% 2) 18% 3) 20% 4) 30% 48) 3 49) 4 50) 4 51) 3 52) 1
48. Suppose that the number of elements in the set
S is 105 and that S is split into n subsets 11m+2
elements each. If m is an integer, then m is HINTS
1) 1 2) 2 3) 3 4) 4 LEVEL - I
1. We have  1, 0   A  A and
www.inpsmcalucknow.com
INPS CLASSES MATERIAL 8 SET THEORY

 0,1  A  A  1, 0,1  A 13. Ac satisfies (1) and (2) by definition, (4) also
But, A  A has 9 elements. Therefore, A has 3 follows trivially.
Assuming A to be any set other than the empty
elements. Hence A  1, 0,1
set, also B = A and C   , we have
2. m n
2  2  56 AB  A  AC
But B  C , So (3) is incorrect
3.  
n A'  B'  n  A  B
'
14. According to De Morgan's Law, we have

= n  U   n  A  B
c

X   Y  X   X  Yc  Xc 
n  S  F   n S  n  F   n S  F 
4.
 
 X  X c  Yc
 n  S  F   20  50  10  60 15. Since every rectangle, rhombus and square is a
parallelogram so
5. f 1 17   4,4 and f 1  3    F1  F2  F3  F4  F1
6.
 A B
7. A   B  C 16.  AB   x : x  B or x  A 
 
A 17. Beautiful is relative term so, it is not well defined
8.  A  B  3, 4, 5, 6 term therefore, it is not a set.
B
18. Different letters of the word ACCOUNTANCY is
A
 1, 2 ACOUNTY 
A  
  AC N  '7'.
B
 C 
 
9. n  C  21 ,
Cardinality of A = 7.
n  H   26 , 19. n  AB   n  A  B   n  A  B 
n  F   29  n(A)  n(B)  2n  A  B 
n  H  C   14 =50 + 20 - 2(10) = 50
20. n  A  B   25  x, n  B  A   2x ,
n  H  F   15
n  A  B  2x
n  F  C   12 , n  F  C  H   8
n  A   n  A  B  n  A  B
Total no.of players = n  C  H  F  43
 25  x  2x  25  3x
10. Since, A  B  A
 B A n  B  n  B  A  n  A  B  2x  2x  4x
A  B  B n  A   2n  B   25  3x  2  4x 
11. Since, A  1, 2  1, 2, 3,5,9 {given}
 5x  25  x  5
 A  3,5,9 atleast 21. n     60, n  A   21, n  B   43
12. n  A  B   max 3, 6  6 Greatest value of n  A  B   n     60
www.inpsmcalucknow.com
INPS CLASSES MATERIAL 9 SET THEORY

Least value of n  A  B   n  B   43 c
28. 
Let S  A  B
c
  B  C
22. F 16   2, 4,8,16
 S   Ac  B   B  C  {De Morgan's
F  40   2, 4,8, 20, 40
Law}
F 16   F  40   2, 4,8  F 8 
 S  Ac   B   B  C  
F  X   F  8  x  8
S  Ac  B
23.   
n A  BC  5, n B  A C  6  , 29. A  1,3,5,15 , B  2,3,5, 7 ,

n  A  B  4 C  2, 4, 6,8

 A  C  1, 2,3, 4,5, 6, 7,8,15

 
n  A   n  A  B   n A  BC  4  5  9
 A  C   B  2,3,5
 
n  B   n  A  B   n B  A C  6  4  10 30. A  1,1 , B  1,1,  i, i

n  A  B   n  A   n  B  n  A  B  A  B   , B  A  i, i

 9  10  4  15  A  B    B  A  i, i
24. n     48, n  A   28, n  B   33 , 31. n     60, n  A   21, n  B   43
n  B  A   12 Greatest value of n  A  B   n  A   21

n  A  B   60
n  A  B  n  B   n  B  A   33  12  21
C
 n  A   n  B   n  A  B   60
n  A  B   n     n  A  B  48  21  27
 n  A  B   21  43  60  4
25. 3N  7N  21, 42, 63....
Least value of n  A  B   4
= 21x : x  N  21N .
32. n(A)=7. Number of subsets of A = 27  1
26. n  A  B   n  A   n  B  n  A  B 
33. AB
we have, 70  37  52  n  A  B  n(A)  6, n(B)  10
A n  B  A   n  B   n  A  B   10  6  4
27. Let 
B
34. n  P   25, n  P  Q   5
 x A & x B
n  P  Q   n  P   n  P  Q   25  5  20
 x  A & x  Bc
 x  A  Bc LEVEL - II
A Since, A   A  B    A  B 
  A  Bc 35.
B
So, n  A   n  A  B   n  A  B  ... (1)
www.inpsmcalucknow.com
INPS CLASSES MATERIAL 10 SET THEORY

Also, B   B ~ A    B  A  '
 
'
 S  A  A  
So, n  B   n  B ~ A   n  A  B  .... (2)
 S  A'   A'     
Hence, if n  A   n  B  , then
S  A'  A'    A'    A'
n  A ~ B  n  B ~ A  {(using (1) & (2)} 40.
Also, from (1) & (2), we have
n  A  B   n  A   n  A ~ B  A  B    B  C    C  A '  A  B  C
41. n  A  B  C   23   6  9  3  5
and n  A  B   n  B   n  A ~ B 
42. Let the number of experts = x
30
x 2x
36. Since S   Ai n A 
2
, n  B 
3
i 1
Now, element in the union S belongs to exactly
1

n  A  B   10, n A C  BC  6 
10 of the Ai 's . So n  S    5  30   15 x 2x
10 n  A  B    10
n 2 3
Again, S   B j So, n  S   3  n  
1 n
j1 9 3  
n AC  BC  6  n     n  A  B  6

n x 2x
Thus,  15  n  45 x   10  6
3 2 3
c  6x  3x  4x  60  36
37.  A  B  C    A  Bc  C c   Cc
 x  24
=  A  B  C    Ac  B  C   C c
LEVEL - III
  A  AC    B  C    C C  43. We have ,
n
 B  C   C  C  = B  C
C C C . 8n  7n  1   7  1  7n  1
38. n(R)=20, n(P)=17
n  R  P   24   n C2 72 n C3 73  ... n Cn 7n 
n  R  P   20  17  24  13
 49  n C2  n C3 7  ...  n Cn 7 n 2  f or
39.
'
'
Let S   A  B   A  B  n2
According to De Morgan's Law, we have
 49  Integer   X  Y
   
S  A '  B'  A '  B
44. Since, R denotes the set of points inside the
rectangle of sides a and b for both a & b > 1,
 S   A'  A'    A'  B  then
R   x, y  : 0  x  a, 0  y  b
 B'  A'    B'  B 45. Let 'U' be the set of all three digit numbers.
Let 'S' be the set of all three digit numbers not
 S  A '  A '   B  B'    containing '2'.
Let 'T' be the set of all three digit numbers not
containing '3'.
www.inpsmcalucknow.com
INPS CLASSES MATERIAL 11 SET THEORY

n  U   999  99  900 49. n  C   224, n  H   240, n  B   336

n  S  8  92  648 n  H  B   64, n  B  C   80,

n  T   8  9 2  648 n  H  C   40, n  c  H  B   24 .
c
n  C c  H c B c   n  C  H  B    n U   n  C  H  B 
n  S  T   7  82  448  

n  S  T   n  S  n  T   n S  T   800  n  C   n  H   n  B 
 n  H  C   n  H  B   n C  B 
 648  648  448  848
n  U   S  T    n  U   n S  T   n C  H  B 
 800   224  240  336  64  80  40  24 
 900  848  52
46. Let n  A   m, n  B   n  800  824  184  984  824  160 .
50. Not a well defined collection
n  P  A    2m , n P  B   2n [ intelligency is not defined for students in a
class]
n  P  A    n  P  B    15 51. n  P   25%, n(C )  15%, n  P c  C c   65%

 2m  2n  15  m  4;n  0 n  P  C   2000
47. Let the no. of persons in the city be 100. C
Then we have since n  P C  C C   65%  n  P  C   65%

n  A   42, n  B   51, n  C   68 ;  n  P  C   35%

Now n  P  C   n  P   n  C   n  P  C 
n  A  B  30, n  B  C   28, n  A  C   36
 35  25  15  n  P  C 
n  A  B  C   100  8  92
Using  n  P  C   40  35  5
n  A  B  C  n  A  n  B  n  A  B Thus  n  P  C   5%

n  B  C   n  A  C   n  A  B  C  But n  P  C   2000
Substituding the above values, we have
 5% of the total = 2000
2000 100
92  42  51  68  30  28  36  n  A  B  C  Total number of families = 5
 4000

 n  A  B  C   92  161  94 Since n  P  C   35% and total number of

 n  A  B  C   92  67  25 families = 40,000 and n  P  C   5%

48. Number of elements in each set = 11m+2
Number of elements in n subsets = n(11m+2)   2  and  3 are correct
52. Minimumm value of
n 11m  2   105  21 5  3  7  5
n  3  11m  2  35  m  3 x  100   30  20  25  15  100  90  10