PTER

Set Theory
Unit I
Syllabus

SetTheory: Introduction and significance of Discrete

Mathematics
Sets Naive Set Theory (CantorianSet
Theory),Axiomatic Set Theory,Set
inclusion and exclusion Operations,Cardinality of set, Principle of

Types of Sets: Bounded and Unbounded Sets,

Diagonalization Argument, Countable and Uncountable Sets,Finite
and Infinite Sets,Countably
Infinite and Uncountably
Infinite Sets, Powerset

1.1 Discrete Mathematics and it's

o The objects belonging to a set are called as
Significance elements or members of that set.

Many objects, such as an integers,

graphs and logic O Objects of a set can be numbers,
do not alphabets,
statements vary smoothly. In discrete namesetc.
mathematics, we study fundamentally discrete The following examples illustrates the concept of
structures rather than continuous. Discrete
set.
mathematics and logic lie at the heart of the
digital
computer. In the discipline of discrete mathematics, 1. Setof numbers.
emphasis is on mathematical logic, which now enjoys 2. Set of capitals of states.
the save status in computer science to that of classical 3. Set of stationery used by any student.
mathematics in physics. 4. Set of all ideas contained in a book.
Many applications of computing involves 5. The set of all Indians.
numerical and combinational calculations.
6. A bouquet of flowers.
Boolean algebra [a topic in discrete mathematics]
is useful in creating logic solution and 1.2.1 Notations
equally
useful in programming too.
Define Membership
Set theory
with proper set notations and
la topic in discrete mathematics) can be
examples SPPU Dec. 17,May 18,1.Mark
used in the design of software system.
A set is denoted by capital letters of English
The understanding of set theory, and
probability alphabet A, B, C,.
combinations allows you to analyze algorithms Elements of a set are denoted by small letters
Every field in computer science, whether it is
a,b,c.
databases, computer organization, computer Ifx is an element ofthe set A then we write,
is related to
network, and programming discrete xeA lread as 'x
belongs to A']
objects.
Ifx is not an element ofthe set A then we write
Concepts and notations from discrete mathematics
xe A [read as 'xdoes not
belong to A']
are very useful in
describing objects and problems
in
IfA is set then A| stands for number of elements in
computer science.
the set A.

1.2 Sets 1.2.2 Representationof a Set

A set is defined as any collection of distinct and There are two forms of representationof a set :
distinguishable objects.
1. Tabular form of a set
O No object is
repeated in a set. 2. Builder form of a set.
 1-2

Discrete Mathematics (SPPU- Comp) Sett

3. Finiteset number of
1. Tabular form of a set a finite
A set having eleme
of a set are set. Elements ofa finite set co
In tabular form ofa set, the elements finite be
) and separated A (1,3,5, 7, 9) is a finites
isted one by one within braces e.g. setwith
count
from each other by commas. elements.

eg. A = India, Japan, Pakistan) B o a finite setwith

is
zero
elements. number n
B 12,4,6,8,...
C {Mumbai,Lucknow, Patna, Bhopal 4. Infinite set

2. Builder form of a set A set having an ninite number of al

of an elemer
Elements of ans
set.
In this form of representation of a set : called an infinite

)We The
write between the braces
variable x stands for each element of the
0a variable X. cannot be counted.
A = (xxis anatural numberj
infinite

) set.

We state the property of The of X

e.g.

B = {x |x is set of all lines passino

|
x. property
origin)
can be denoted by px).
i)x and px) are separated or (read as 'such 5. Subset
by
that) Set A is said to be a subset of a set B i
e.g. A = {xp(x)} element of setA is also an elementofset R
A = {x |xis capital of states) Set A is a subset B is represented
of set as Ac
A = {x |xis an even number and x 2 2) IfACBthen ifx e A=xe B
Example
1.2.3 Types of Sets
Let A = 2,3,4
Define following with proper set notations and and B (2,3,4, 51
examples

) () A B
) Proper subset

Emptysets
(v) Equality between sets
(v)
Power sets

Subset
then write

5. Proper

Set A
subset

is said to be a proper subset of a set B if:

SPPU Dec. 17, May18, 5 Marks (a) Every elementof set A is an element of set B.

1. Null set (or empty set or void (b) Set B has at least one
set) elementwhich is
nota
element of set A.
A set having no element an empty set.
is denoted by ¢ or ( }.
is called
It
A is a proper subset of B is represented as Ac
S
BA
e.g
A = {x |x is an even number not divisible
by2
e.g.

B =x|x is animmortalman}
Let A = {1,2,3) and B {1,2)
2. Singleton set
then BcA
A 7.
set having a single element is called a singleton Comparablesets
set.
Two sets A and B are said !
rable
to be compara
e.g either of these
happens.
A = {x|x is
present president of India}
(a) AcB
B 5) (b) BcA
(c) A B

TechKnewled
Publitatio
 Discrete Mathematics (SPPU-Comp.) 1-3 Set Theory

8. Universal set Soln.

Any set which is super set of all the sets under Let a set S e P(A), Now we can say that S cAA.
consideration is known
denoted by S or U.
as the universal set. It is
Since,A B
9 Power sets
SEA SEB.
The set of all the subsets of a given set A is said Thus, any element of P(A) is also in P(B) and hence
be the power set
of A
and is expressed as P(A). PA) C PB)
So, if a set B e P(A) then B cA 1.2.4 Some SpecialSets for Numbers
E PA) N The set of all natural
numbers (1, 2,
3,..
A e PA The set of all integers
e.g 3,-2,-1, 0, 1, 2, 3,..
1.If A =12 Z The set of all 2,..
positive integers {0, 1,
then PA) = o, {2}}
Q The set ofrational numbers
2. If A {1,2
The set of non-negative rational numbers
then P(A) Io, {1), 12),
(1,2}}
3. If A R The set of real numbers
(1,2,3
then R The set of positive real numbers.
PA) = lo, {1), {21, (31, (1, 2), 11, 3), {2, 3), {1, 2, 3)} 1.3 Naive SetTheory
If A has n elements then P(A) has 2"elements.
(CantorianSet Theory)
Ex. 1.2.1 : Find the power set of A ={(a, b), c}
Naive set theory is defined informally in natural

language. It is a stepping stone to more formal

Soln. Power set of A,
treatments and adequate for many purposes. Venn
PA) = (o, {(a, b)), {cl, ((a, b), c}l
diagrams are commonly used to describe various

aspects of sets.
Ex.1.2.2: Identify whether each of the following set is

finite or infinite. 1.4 Axiomatic Set Theory

) lines through origin}

the equation 3x= y}

Several paradoxes were discovered in the naive set
Gi) lines that satisfy
theory. In order to eliminate such problems, an
(ii) {ways to order the number 1
through 1000}
axiomatic basis was developed for the theory of sets.
Soln. The very basis of axiomatic set theory is Zermelo-
G) Infinite: There are infinite number of lines
Fraenkel axioms.

) passing through

Finite
3x =y.
: There is
origin.

only one line with the equation

1.5
1.5.1
Types of Set(Advance)
Bounded and Unbounded Sets

ii)Finite:Numbers can be ordered in 1000 ways, A set is called bounded, if it is of finite size.

which is value.
finite a set which is not bounded is called
Conversely,
unbounded. A set can be bounded above and bounded

Ex.1.2.3 B
Let A and aretwosets. If Ac
B.thenprove below. For example, a set of integers is bounded above
thatP(A) PB,where P(A)and P(B)are if every element is smaller than a value M and
e
powersets of A and sets B bounded below if every element is larger than a value

SPPU- Dec.17, 6Marks N.

Techknowledge
Publtcations
 D Discrete Mathematics (SPPU -Comp.)

1+
1-4

IfA is uncountable
also uncountable.
and B is y set,
any set,then
Set

A xB
Theon

The set of numbers of the form

infinite set is uncountable.
unbounded
set. Power set of any
where n21is an integer form an
Countability of Rational Number (Usi
The set of numbers of the
form 1 1.5.4
Cantor DiagonalizationArgument)
Jsing

set.
an example bounded
2on where n2 1 is of
the set of
Q Prove that rational numbers is countal

infinite
1.5.2 Finite and Infinite Sets
Number of elements in a set is also known as its SPPU May 18,4Marks;May 19, Dec. 19, 3Marks
Let us first try to understand the
principle of
cardinality
than or equal to
IfAcB, then the size of A is less diagonalization.

that of B. Diagonalization Principle

A B are said be equinumerous
Two sets and to
Let R be a binary relation on a set A and let D, the
if there isa
(having same number of elements) R.
diagonal set for
(one-to-oneand onto) R and
bijection
If a eA then(a, a)
f:AB If a eA then (a, a) e R
A finite set has finite number of elements.
Let A {(a,b, c, d,e, D

,, ,
A set is infinite if it is not finite.
and R (a,b), (a, d), (b, b), (b, c) (c, c),
The set N of natural number is infinite.

d, b), (d, c), d, e), (d, D, (e, e),

1.5.3 Countable and Uncountable Sets (e, a), (,c), (4, d), e))

The relation R may be shown as given in the

Q.Define the following with examples 1.5.1.
Fig.

0 Uncountable infinite set

(i) Countable infinite set SPPU -Dec. 16, 3Marks

the set
Q. Explain concept of countably infinite with

example. SPPU-Mlay 17, 3 Marks

An infinite set S is said to be countable or

countably infinite if there is a bijection from N to S.

f: NS is abijection
The natural numbers, integers and rational

numbers are all countably infinite. Any union or

intersection or Cartesian product of countably infinite

Fig. 1.5.1

set is also countable.

The sequence ofboxes along the diagonal is
If a set is not countably infinite then it is an
uncountable set.

Any interval (A, B) of real number is uncountably

infinite. Its complement is,

Any subset B ofuncountable set A is uncountable.

If A is uncountable and B is any set, then the

union A UB is also uncountable. This corresponds to the diagonal set D = la, d, f

TechKnowledge
PubiltationS
 Discrete Mathematics (SPPU - Comp.) 1-5 SetTheory

The diagonal set differs from every row of the

Assumptions
relation-matrix.
1. Each o; is distinct
Uncountability of Real Numbers
The set of real numbers between 0 and 1 is
2.
a e [0,1,2,3,4,5,6,7,8,91

uncountable. Using the principle of diagonalization, we can find

Proof: We can prove the
uncountability of real
a string k =X11 X22 X33., such that og e S.

numbers using the principle of

diagonalization and ii aji +1, if ai5
contradiction. 4, if
a25
Given a set of real numbers, we can
of always Now, it should be clear that:
generate a new real number which differs from
every real number in the set. This
can be done
will differ from o
atthe first place

the principle will differ from og at the secondplace

using of
diagonalization.
We can assume that the set of real numbers is
countable and then establish a contradiction. For a Ogwill differ from o,at the nh place.
set to be countable, there is a 1-1 from N (set of Therefore, the set S is uncountable.
integers) onto the set of real numbers between 0 Hence, proved by contradiction.
and 1.

1.5.5 Examples
Formal Proof: Let us define a set S.
S = {x| (xe R) and (0 <x< 1)} Ex. 1.5.1: Show that the set of numbers of the form

Now, the proof can be given in two steps: 1+ wheren21isaninteger,

1. By proving that S and R have the same form an unbounded set.

)
cardinality.
Soln.
2. The set S is not countable.
These two steps R is not countable.
Let, n =2
will imply that

Step 1:Proof that S and R have the same cardinality Now, 1++3
RS
Let R be the setof all positive

be defined
by
real

f)=4X forxe R. Obviously

numbers. Let f:

--( (G43)-
the range of fis in S.
k112k-12 2k-1+3 2
for any yeS, we have x = .Thus fis
Further,

one-to-one and onto. Therefore, the set S and the set R 21 12

have the same cardinality.
There can not be any number M which is greater
Step 2:The proof that the set S given by S ={x|x e R than1+
and 0< x < 1} is not countable.
If k 2| Ml is the smallest integer
largerthan
We can prove this by contradiction.
2M,then
Suppose S is a countableset.
S fo,02...
k
1+21 + M 1+M 2
Which is a contradiction.
where, @1 a11 a12 13
D2 a21 a22 a23

On an1 an2 an3

 Discrete

Ex.1.5.2

1
Mathematics

Show theat
(SPPU-Comp)

the set
sel of number of the form

hwhere n2 1 is an
1-6

Ex.1.5.4

Soln.
: Show that

countable than S-Tis

if
Sis
uncountable
uncountable and

1
integer, form abounded set.
We can prove this by
Soln. contradictio on.
Suppose S.T is countable set
Let
S-T
o1,02,n
then where, O1 a11 a12
9n+ 02 a21, a22
Now
0 an1: n2
S--1i It is given that the

T x1,X2..Xm
set T is
countable

Since, the set S is

uncountable, we can
a word y such that
always
fin
y e S, ye S-Tand yeT
Hence, a contradiction.
or,
S-21-1 s2 Therefore, S-T is uncountable.

Therefore,
set. Since,
M
all the
2 an upper bound on the
is

numbers are positive, 0 is the

given
Ex. 1.5.5

Soln. We
Show thatthe set Zis
countable
bound. lower "count" the elements
of as follows Z
N =1,2,3,4,..
Ex. 1.5.3: Show that any subset
of a countable set S Z <..
cOuntable 3,-2,-1,0,1,2,3,...
This to the
Soin.: Let corresponds
A bea given countably following bijection
Let S be an infinite
infinite set. f N Z
Obviously, there exists
subset of the set A.
fn) = n n even
/2, is and
a bijection
N of natural
numbers and the set A.
between the set
fn) = (n -
1)/2, n is odd
f:N =
A, fn) x for xeA is a
Ex. 1.5.6:
bijective relation. Show that N x N
Elements of theset A can be is
countable.
arranged as Soln. This can be
f1),f2),f3)... proven through
count. cantor's diagonal
Now,we can delete from the
set A, those
which are not
present in S.The
elements NxN {(1,1),
remaining (1,2), (2, 1), (1,
A must infinite. Let us
be elements in
(1,4),2,3),
3),(2, 2,(3,1,
denote these
elements by: (3,2),(4,1),..
fi),fig). Elements are
paired according to the sun
two
Now, we can define a function coordinates.
Elements
ot
listed in the
g:NS such thatgln) fi,) =
sums and
coordinate.
for the
same sum in the order of
order of

the
thei

Thus,g is one-to-one and onto.

This
Hence,S is countable. corresponds to the
f NxN N bijection

givenby
fG,
k) G+k-1) G +k-2)
+j

E TechKnowled
Publict
 Discrete Mathematics (SPPU- Comp.) 1-7 Set Theory

1.6 Set Operations 1.6.3 Intorsection of Two Sets

Here we discuss mainly
will
five operations on The intersection of two sets A and B is the set of all
sets.These operations include: those elements which are both in A and B. It is denoted

1
Complementof a set by AnB.
2. Union of sets AnB xxe A and xe B}
3. Intersection of sets For example
4 Difference ofsets If A (1, 2, 3, 5)and
5. Symmetricdifference of sets.
B 12, 3, 4,6,71
1.6.1 Complement of a Set then A nB {2, 3
The complement of a set A is the set of all those If may be noted that
elements of the universal set U, which are not in A. It AnA =A An
is denoted as A or A'
AnB B if BA
For example AnB =A if AcB
Let U = {1, 2, 3, 4, 5,6, 7, 8, 9} and
A AnU =A AnA =
1,2,7,9
1.6.4 Difference of Sets
then A = (3,4, 5, 6, 8) The difference of two sets A and B is the set of all

Thus, A can be written as those elements of A which are not in B. This is denoted
byA-B.
A = {x|x e U and xeA) A- B = x |x e A and

U
x# B}
It may be noted that

and U = Similarly,

B-A = {x |x e B andxg A}
1.6.2 Union of Sets For example
If A 4, 5, 6, 7, 8, 91 and
2. Define Union of sets with proper set notations and
B 12,3,5,7
examples SPPU-May 18, 1Mark
The union of two sets A and B is the set of all those
then A-B 4, 6, 8,9
elements which are either in A or in B or in both. This Similarly,

isdenoted by AUB. B-A (2,3)

AUB x|x e A orx eB] It may be noted that

For example A-B B-A

If A = 12, 5, 9, 15) and Difference of sets is not commutative]
B 1,2,4,5, 6)
then AuB {1, 2, 4, 5,6, 9, 15)
A-A = A- = A
d-A =
It may

AUA =A
be noted that

Auo = A
A-B A if AnB =
AuB =A if A B A-B if AcB
B
AUB B if
AB A-B B-A if A
AuU= U AUA U A-A =A
TechKnowedge
Pubtitations
 1-8

Mathematics(SPPU- Comp.) sets

Discrete
(b)
Union of

1.6.5 Symmetric Difference B 1s Case I: AUB =B, this ha

A and
two sets
ne
symmetric diference
off

as ehen
denoted by A ® B and it is
defined
U
A ®B = x/x e A -Borxe B-A)
as (A -B)u (B-A).
®B can also
A
For example
be written
AUBwhenA
Fig.1.7.2
B
A 9) and
If 14, 5, 6, 7, 8,
Case II: AUBwhen neither
her
B 12, 3, 5, 71
ACB
then A eB =(A-B)u(B- A) nor B
9)
14,6, 8, 9) U12, 3) = (2, 3, 4, 6, 8,
It may be noted that
AeA = A A AUBwhenneither
B

AcB
AeU A ADA U norBcA
Fig. 1.7.3
AeB (AUB)-(AnB)
Case IIl: AUB when A andB are
EX. 1.6.1: Let A, B, C be sets. Under what condtions the
disioints

following statements are true ?

0(A-B)u(A-C)A
() u(A-)=

)
(A-B)

SPPU-Dec. 15,2Marks
AUB when A and B
Soln.: B and C are NULL sets are disjoint sets

i) A, B and C are identical sets.

Fig. 1.7.4

1.7 VennDiagram (c) Intersection of two sets

Operations on sets can be represented with the

Case I: AnB when A gB
pictures. The diagram formed by these sets is said to

be the Venn Diagram.

A set is represented by circle or a closed

geometrical figure inside the universalset U.

The universal set is a

represented by rectangular AnB A
region.
The shaded Fig. 1.7.5
region gives the answer for any
statement. Case II: AnB when neither AcBnorBg
(a) Complement

A AnB when neither AcB

norBc A
Fig. 1.7.1

Fig. 1.7.6
 Discrete Mathematics (SPPU- Comp.) 1-9 Set Theory

Case Ill: ABwhen A and B are disjoint

B
(e) Symmetric difference
sets.

A =(A -B)u (B-A)

Case I:A B when AcB

AnB
Fig. 1.7.7

ADB when AcB

Difference of sets
(d)
Fig. 1.7.12
A-B represents the area of A that is not in B.
Case II: A B when neither AcB nor BcA and A
Case I:A-B,when AcB A-B =o] and B are not disjoint.

A
A- B=
AOB when neither AcB nor BsA
Fig. 1.7.8 and A and B are not disjoint

Case II: A-B, when BcA Fig. 1.7.13

Case III: ADBwhen A and B are disjoint.

A-B when BcA

Fig. 1.7.9 AOB when A and B
are disjoint

Case III: A-B when neither AcB nor BcA Fig. 1.7.14

Ex. 1.7.1 Let A (o b) construct the following sets

0A-
) A
A-B when neither ACB (i) AuPA)
forBcA
v AnP(Awhere P(A) is a power set

Fig. 1.7.10 SPPU Dec.19,3Marks

Soln.
Case IV: A-B when A and B are disjoint sets

PCA) {o, fo}, (b}, {o, b}}

(1) A- A =(0,b}
(ii) o-A =
(ii) AUPA) = f0, b} u l¢, (o}, {b}, (o, b}}
A-B when A and Bare
disjoint sets = 1,b, {o}, {b), lo, b}}
= lo}
Fig. 1.7.11 iv) AoP (A) = (,b} n lo, (ol, {bl, {o, b}}

TechKnowledge
Pulications
 1-10

Comp
Mathematics (SPPU 2 Associativity

Au(BuC)=(AUB)
Discrete

(a)
false
=
An(BnC) (AnB)o
true or
Ex 1.7.2 Sttewhether
b)
())iel)
(b) Distributivity
3.
=
(a) Au(BnC) (AUB)t UC)
Soln
(b) An
BUC) =(A (AnC)
(aTrue Tell contains the eletment (0 set
laws
b) True : Empty set is a subset of
every
4. Idempotent
is 16) and
e) False: The nly ement of the set
llol)
(a)
AUA =A
not e.
(b) AnA =A
or False
2, 3. True
Ex. 1.7.3: Let A denote the set fK), laws
5 Absorption
(a)1eA (a) Au(A nB) = A
(b)11) e A
(b) An (A UB) = A
Soln.
to A. law
a) True :(1) belongs A and 1 does not belong 6. De Morgan's
b)True:(1) belongs to A.
(a) AUB = AnB
Ex. : State true or false =o
1.7.4 {0)
(b) AnB =A UB
Soln.
is not an Prove the De Morgan's law
False stands for an emptyset. ol Ex. 1.8.1 for
any two se
one element, namely, the set o. and B.
emptyset as itcontains
tmay be noted that the following statements
1. (AUB) =AnB
aretrue
la) e b, c, lall als(a, b, c)
2 (AnB)=A UB
ta) b, c, lall fa, bl s la,b Soln.: Proof

e la, b,o) lol e la, b,c 1. Ifx e (AUB)

cla,b) fo)e fa, b,ô}
x£ (AUB)
1.8 Laws of Set Theory
x£ A and x e B
ASsociatively, commutativity
properties are obeyed by the
Cancellation rule is not applicable
set
and

operations
distributivity

to sets.
x eA and xe B

Idempotent laws, absorption laws and De Morgan's xeA nB

laws are applicable to sets.

The
set operations satisfy the
'Ifx e (AUB)x eAnB
following rules for
any given sets A, and C. B So, (AUB) =AnB
1. Commutativity

AuB = BUA
2. Ifx E AB
(a)
x£ AnB
(b) AnB BnA
x A or x e BB

Techlaal
 Discrete Mathematics (SPPU- Comp.) 1-11 Set Theory

xEA xe B or Ex. 1.8.3: Prove the the Venn

x eA UB Diagrams
() AuBnC) (A
expressions

B)nAuC)
by using

Hence AnB A UB (i) An(BuC)=(AnB) U(AnC)

may be noted that the De Morgan's law can also
Gii) An(B C)= (AB)(AC)
be
as SPPU- Dec, 12, May 13,May 14,2Marks
expressed
Soln.
e)A-(BU)=(A-B) nA-C) i) Au (BnC) (A UB)n(Au C)
(b)A-B0C)= (A-B)(A-C) L.H.S. = AuBnC)

Ex.1.8.2 Show that: Au (BnC) = (AUB) n (AUC)

using Venn diagrams.

Soln.
L.H.S. = Au(B oC

1. BnC 2. Au (Bn C)
R.H.S. = (AUB)n (AUC
1. Sets A, B and C 2. Set B

3. AuB 4. AuO
3. Set B C 4.
Set AuU (Bn C) B

R.H.S = (AUB)n(AUC)
5. (Au B)n(A u C)

Fig. Ex. 1.8.3

AuBn=(A UB)n(A
C) UC)

AUB AUC
An BuC) = (AnB)u(AoC)
5. Set 6. Set
(i)

L.H.S. = AnBuC)

7. Set (A u B)n (AuC)

1. BuC 2. An (BUO)
Fig. Ex. 1.8.2

R.H.S. = (AnB)u(AnC)
Thus, Au (B nC) =(AUB)n(AUC)

TechPutticattons
Knowledge
 1-12
Mathematics (SPPU - Com
Discrete
Soln. = d
(SPPU- Comp A)
Discrete
Mathematics
i) An(B-

1.BC
3. AnB
1. B-A
2.
An(B-A) R.H.S. =(A 9B) C
Fig.
Ex. 1.8.4

An B-A) = ¢
= A'UB
C)
(AnB
4. AnC
5. (An B) u{An
ii)

L.H.S.
= (AnBy 3. A B
Fig. Ex. 1.8.3(a)
Fig. Ex. 1.8.

A BOC) =(A
nC)

AnBUC) =(AnB)U(A G

ii An(BeC) (AnB) (A nC)

= e AnBnC A-I(A-B)
L.H.S. = An(BO C) L.HS. = ABnC
2.
1. AnB (AnBy

Fig. Ex. 1.8.4(a)

R.H.S.= A'UB'
1.BeC 1. AnB
Symmetric differenoe 2. An (B C)

R. HS. A- I(A -B)u

R.HS. = (AnB)e(AnC)

3. A 4. B

3. A-B
3. AnB 4. AnC

5.
A'U B
Fig. Ex. 1.8.4(b)

B) u (A-C)
AnB =A'UB'
5.
(A

AnBeC) =
5. (An B) e(AnC)
Fig. Ex. 1.8.3(b)

(A nB) e(AnC
EX.1.8.5

)
Using Venndiagram,

U AnBn C A-(A
AeB C)
prove or

(Ae B)eC
disprove

B)uA-C)) X. 1.8.6:
AnBoC
Prove the
Fig. Ex

follo-

)
Ex. 1.8.4: Provethe
following
An (B-A)=¢
statements :
Soln. SPPU May 13,4Mat A-(A-E
()

(An B) =A'uB A-B A

(i)
ADBC) =A (ii)

B) C
L.H.S.
=A B C)

TechKnowle
Publlcati
 Discrete
lathematics (SPPUComp 1-13 Set Theory

)
Soln.

A-A -B)

1. B C 2.
A(Bec)
R.H.S. = (A B) C
1.(A-B) 2.A-(A-B)
Fig. Ex. 1.8.6

A-(A-B) = AnB
3. A B

Fig. Ex. 1.8.5

4.
(A B)C
Thus,
and AnB
A -(A-B)
B
cB
Ae Be C) =(A B) C ii) A-B =AnB
)AnBnC A-CA -B)u(A-C]
L.H.S. = AnBnC

3.(A-B) 4.B

1. AnB 2. AnB nC

R. H.S. = A- [(A-B) u(A -C)]

5.AnB
Fig. Ex. 1.8.6(a)

3. A-B 4. A-C
A B=AnB -

Ex. 1.8.7: Draw Venn diagram and prove the expression.

()(AUBuc)°=(AuC)°nAuB
i) (UA)u (BnA) =A

Soln.

5. B)u (A-C 6. A -[(A- B) u (A C)] (AUBUC) =(Auc)n(AU BC

(A
L.H.S. =(AUBU C)
Fig.
Ex. 1.8.5(a)

AnBoC A-IA -B)u (A -C))

Ex. 1.8.6 Provethe following using Venn diagram.

A-(A- B) cB 1.AuBuC 2.(AuBu

A-B AnB
Gi)
Fig. Ex. 1.8.7

TechKnowledge
Publitatians
 SeT
1-14
AnB =BnA Co
xE AB
that Mathematics (SPPU
Proof Discrete
(SPPU-Comp.
xE B
Discrete

RHS=(AUCnA
BMathematics If
xeAand
xeB and
x eA From (a) and (b),

A-B
we can

A
write

xeBOA and B-A B--

Sets
Cardinality
of Finite The result A uB A +
1.9 tained by substituting for A
4.(A u) of Sets Witn
with proper B A -B + JA nB]+B-A
set
3 AuC Define
Cardinality

and examples
notat
SPPU-Dec.17, AUB A-AnB4
The number
of elements knowna
in a A+B- 1A.

mber of elemen
The number of elements in a set Principleof inclusion-exclus

AuB
6. (A B) cardinality.
byA|.
A three sets A, B andC.
5. denoted
=0 AUBUC = A+B+ C
.IfA =o then |A|
IfAS Btwo
then A| sB A and B
-IBoC+
Principle of inclusion-exclu
sets
disjoint
For any a finite collection of sets.

7.(Aun(AuB) A UB A + B Let A,Ap Anbe a finit

Fig.
Ex. 1.8.7(a)
For a collection of disjoint
sets A,A2, Ag,A
(AUBUC) = (AUn (AUB)
AAgU...A= A1
+ |A2l
+.. A UAzU ...UA,= 2 A-
G)UnA)uBoA)=A i =1
1.9.1 Principle of Inclusion-Exclusion
U

Let A and B be finite sets

then 1si<j<k
+-1)n
1. UnA 2. BnA A UB A|+ B-ABI
.1.9.1 It was found tha
Proof: Let us consider the Venn-diagram as given science of 80 stu
Fig. 1.9.1. 55 know 'Basic a
not know any lang

Find
3. (UnA)u(BoA)
() How many k
Fig. Ex. 1.8.7(b)
(i) How many k

(UnA)uBnA)=A B
oln.: Let us draw the V
Ex. 1.8.8: Prove commutative laws of rious regions.
sets.
Fig. 1.9.1
Soln.:
Commutativelaws
From the
G)AuB BUA be
Venn-diagram, it is clear that AU
i) AnB BnA dividedinto three
parts:
(a)
Proof that AuB= BUA 1A-B(bB-A (c) AnB
We can
If x EAUB draw
following onclusions from the Ve
xeA or x E B
diagram Basio

=xeB or x E A A A-B +AnB

xeBUA B
AUB=
=B-A
+AnB
1. Student knowing exac
1
subject

A+1Agl+1Agl
A-BI+A B|+B-A
TechKnowls
Publicat
 Discrete Mathematics (SPPUComp.) 1-15 Set Theory

From (a) and (b), we can write

A-B =A-AnB A A2
and B-A =B-AnB C++
The result u =JA A B + B A n B can be
oined by substituting for A B and B Ajin
IAUB=A-B|+ AnB+B-A Aa Basic

AUB= A-An B +A nB|+B-An BI 3. Student

=A+B|-1AB 3 subjeots
knowing all

Principle of inclusion-exclusion
can be extended to
three sets A, B and C. Fig. Ex. 1.9.1

IAUBUC = A+B+CI-AnB-JA oC Total number of students is 80 and 8 did not know

B nC+ABo C any language.

Principle

a finite

Let A,A

2 Al
AUAU...A,=i=1
,
of inclusion-exclusion can
collection of sets.

A be
n
a
be extended to

finite collection

2 AA
of sets then
Al++Agl+ Bl+Bl+Bgl +C=80-8 72and
A+B+B+C= 50
A2l+Bl+Cl+ B3l=25
Agl+Bal+ C1+Bg =55
[C-languagel

[C++1

[Basic]

A+Agl+ Agl+2 (B|+ Bal +Ba)+3C = 130

1si<jsn

1si<j<ksn
An AnAxl
Note The data

any unique solution.

givenis incomplete. There does not exist

+-1)- AnAgn...Al Ex. 1.9.2 : Among 200 students in a class, 104 students
got 'A' in first examination and 84 students got
Ex.1.9.1: It was found that in
year of computer
first

science of 80 students, 50 know 'C'

'A in second examination. If 68 students did
language, not get an 'A' in either of the examination.
55 know 'Basic' and 25 know 'C++,while 8 did

)
not know any language. i) How many students got 'A' in both the

)
Find

(i)
How many know
How many know
all

exactly
the three

two
languages.
languages
(i)
examination

If

first
number
examination
?
of students

is equal
who got 'A
to that
in

who got
the

an 'A' in second
us draw
Soln.: the Venn-diagram and mark examination. If the total
Let the
various regions. students who got 'A' in exactly one
examination is 160 and if 16 students did

not get 'A' in both examination. Determine

M the number of students who got A in first

C++ examination, those who got A' in second
B examination and number of students who
got A' in both examinations.

Basic Basic Soln.:Let, F Set of students getting A' in the

first examination.
1. Student
knowing exactiy 2. Student knowing exactly
S Set of students getting 'A' in the
subject
2subjects
A+Aal+ Agl B+1Bal +|B3l second examination.

TechKnowledge
Pubtit ations
 1-16
Discrete Mathematics (SPPU-Comp)
Let us mark various regions of the Venn-diagra
We also know,

from the given details. FUS

+1S-P
or, 200-16 =
From the two F+1S-®ns
(1
Equations
()
200-16-160
Putting the valu
F
of
Fo2 and

1.
Students not getting an
A'In elther of the 2. Students getting'A'
F+S=160
inEquatn
eNamination 200 68 132
F 1S
180+224
Result 104

Number of students who

examination = got'A

)
104
inint
Number of
studentswho dot
examination = 104 Ain
got'A.
3. Students seema
getting A both in Number of students
who got'A.
theexamination = |Fo S|| examinations 24 = both
Fig. Ex. 1.9.2

Weknow,
F == 104, IS| = 84

FuS F+S-F nS
or, 132 104 +84-FoS
OT, FoS = 188 132 56 6. Various
regions
11) Let us mark various
regions of the Venn diagram Fig. Ex.
from the given details. 1.9.2(c)

Fes Ex. 1.9.3 Consider a setof integers 1 to 5

FuS many of these numbers
5or11 aredivsbe

Also indicate how manyare drke

orby 11 but notby all 3,5ad1

Gi) How many are divisible by 3at

by5 SPPU-Dec.
14.2
4. Total number of students
Soln.: Let,
geting 'A' in exacty 5. Students not
getting
one examination 160 = an
'A' 16 A: Set of integers from 1 to 500, divisihey

(a) (b) B: Set of integers from 1 to 500, divisbe

Fig. Ex. 1.9.2 C: Set of integers from 1 to 500, divisibe y

Number of students getting A' in first

examination 500
Number of students getting 'A in the second A= 3 166
examination = |F|
=IS 500 500
B 100|C=11
Marked region in the Venn-diagram shown in

Fig. Ex. 1.9.2(a).

AnB = 5005033
3x515
= F+ |S -2 F n S = 160 .1) bybolth
Divisible
 athematios (5PPU Comp.) 1-17
Discrete Set Theory

IAnC 311
15
83

Divisible by both 3 And 11)

B00
(BnC 11x
3.Dvielbte 3or by 5
500 by 11 but not by

669 12112+24 157

Fig. Ex. 1.9.3(a)

Divisible by both 11 and 5)
Ex. 1.9.4: In the survey 60 people, 25
AnBC 500 500 of
it was found that

3x6x11 165 read

26 read
Newsweek magazine, 26 read Time
Fortune. Also 9 read bothNewsweek
Divisible by 3, 5 and 11) and 11 read both Newsweek and
Fortune
Let us mark the various regions of the Venn- Time, 8 read both Time and Fortune and 8 read
no magazine at all.
dingram,
() Find out the number of people who read
IAnB-AnBnC all

the three magazines

10-303by12 121
onty 3)
AnBC (i1) Fill in the correct
number in all the
(DiMsbse regions
Venn diagram
of the
100 30-3601
Determine number of people
(Divislble by only 5) (il) who read
AnC-AnBnC -JBnC-1AnBnC exactly one magazine.

45 12-3-6 24
SPPU Dec.19, 3Marks
(Dlvisible by only 11) Soin.

Fig. Ex. 1.9.3 Let, N: Set of people who read Newsweek

T:Setof people who read Time
F: Set of people who read Fortune.

N =25, T 26,
F = 26 NnF= 9,
NoT = 11,

IToF 8
No. elements divisible
1. of

by 3 or by 5 or by 11
= 121 +61 +24 +30+8+12 +3
NuTUF |=8,
257 U= 60
From the principle of inclusion-exclusion

INUTUF| =N +T +F NnTI-N n F
Eoo 61B +-1T Fl INnToF
OT 25+26+26-11-8-9
60-8
+IN nToF

or,
=
NnTnF| 52 49=3
2. Divisible by 3 orby 11 but not by Let us mark the various regions of the Venn
all 3,5 and 11
=121 +30+12+6+24 193 Diagram.

TechKnouwledgë
Publlcations
 1-18

of students who 8tnd.

Ay
Discrete Mathematics(SPPU-Comp Number all
Tn FI three
Nn TI-INn
11-3 =IFnGnR lan
10 We know,
26-8-3-5=
FuGUR= P+|G+R
25-8-3-B8
INTFI
FoTI-/Nn
B-35
Tn FI
-FR-GnR
+FoGnR
28-6-3 5 12

100 65 +45 +42-20

INAFI-}NATAF1
-3 or,

Fig. Ex.
1.9.4
three
+FoGn R
Fn GoR = 100 +60
the
Number of people who read all
=
152. 8
magazines = NoFn T = 3 or,

8 Number ofstudents reading allthree

languag
1aqes
Let us fill the various regions of the
theVenn
diag
FnG-
FoGoR
20 20-8=12

12 a 18
45-12-8-1
No. of people who read 65 12-8-17 28 -IFn@oR
exactly one magazine 10
8+10+12 30 @nRI-
IFn@nR
15-
Fig. Ex. 1.9.4(a)

100 120 mathematics TFoRI-IFoGnA1

Ex. 1.9.5: Suppose that out of
25-8= 17 42-17-8-7
students at a take at least one of the
college

languages French, German and Russian. Also 20

suppose, 65 study French, 20 study French

and German 45 study German, 25 study

French and Russian 42 study Russian, 15 G
German and
study

0 Find
Russian.

the number of students who study all

F17
the three languages.

(i) Fill in correct number of students in each

region of Venn diagram.
Students one subject
(i) Determine the number K of students who reading exactly
28+ 18+10 56
study.

(a) exactly one language

(b) exactly two
languages
Soln.: Let F Set of students taking French 28 8
G Setof students taking German

R Setofstudents taking Russian 10

F= 65, G=45,
R= 42 FoG| = 20, Tudents reading two
=12 + 17+7 36 exactly subjecis

FoR = 25, GnR 15

Fig. Ex. 1.9.5

Techla
PuDlleat
 hathematics (SPPU
Discrete -Comp.) 1-19
Set Theory

Out of 1 to 1000
Ex. 1.9.6 integers
Hence, 229 integers from 1 to 1000 are
() How many are not divisible by
divisible by 3, nor by 5 3 but not by 5 and 7.
nor by 7 ?

How many are not

(i)
divisible by 5 and 7 but Ex. 1.9.7 In a survey of 100 new cars, it is found that 60
3?
divisible by
had Air-conditioner (AC), 48 had power
SPPU Dec.12, 6Marks, May
14, 4Marks, steering (PS), 44 had power-windows (PW) 36
May 19,3 Marks had AC + PW, 20 had PS 16 hadAC,
Soln.
:Let, A Set of integers divisible by 3 PW+PS, 12 had all the three features.

BSetof integers divisible by 5 Find the number ofcars that had:

CSet of integers divisible

by7
(0) Only PW

A= 1000
3 =333
(i)

(ii)
PS and PW
AC and PS but
but not

not
AC
PW

B O00
5 200
Soln. Let us fill up the various regions of the venn-
diagram.

7
C 000 142 Step 1:

1000
AnB 15 66 Divisible by 3 and 5
AC PS
1000
AnCl= 21 47 Divisible by 3 and7
BnCI= 1000
35 28 Divisible by 5 and 7 PW

AnBnC]=1000 AC n PSn PW| = 12

105 =9 by 3,5 and
|
Divisible 7]

Step 2:
Numbers not divisible by 3, nor by 5, nor by 7

= 1AUBUC AC PS
1000 |AUBUC

-
1000 (1A|+|B|+|C
1AnB|-JAnCI-|BnC
+1AnBnC)
= 1000-(333+200 + 142 66 28-47 +9)
= 1000-543 457
|
Step 3:
AC n PS|-|AC
PW
nPWoPS |= 20- 12 =8

AC
57 12
B
333-(57+9+38)
229
PW
C AC n PWI-| AC nPW nPS
Not divisible

but
by
divisible
5 and 7
by 3
36-12 24

Fig. Ex. 1.9.6

TechKnowledge
Pulit 3ti0n
 1-20

Discrete Mathematics (SPPU- Comp

Soln.
M-Setof students
Step 4 Let,
Set ofstuden
studying
math.
P
studying
B-Setof udents
studying physi
=
M 32,
PI idlogs
20,
B 45, MoB| 15,
= PoB
PW MoPI 7,

10,
PSPW1-PS PW nAC MUPUB| = 30,

=16-12 4 U =100
Step 5:Similarly, flling other egions we ge MUPUB| = |U-MUD
80-24-12-8
58 100-30 70
B
We knowW,
PS
MUPUB| = |M| +|P|+|B
48-8 12-4 -|MoPI-|MoB
24
-|PnB +|MoPohB
PW
44-24-12-4=4 OT,
70 32+20+ 4515-7-10

AC 56
56 24
PS
or, |MnPoB|
Let us fill up
+|MoPnB
= 70-97
the various
+32 5
regions of
theVe
diagram.

30
PW PW
2. Cars having PS and PW 15
1. Cars having only PW= 4 but not AC=4 M

56 25
AC 2 PS

Ex. 1.9.8 : Among

20 study
3. Cars

100
having
but not
W

students,

physics,
AC and PS
PW =8

32
45 study
study
mathematics
biology, 15 study
subject =
Number
three subjects
15
|
Number

+8+25 = 48.
MoPoB
of students
is
Fig.

of students
Ex.

5
1.9.8

studying

studying exactly one

given by the Venn diagram,
all the
thre

of

whieh
t

mathematics and Biology. 7 study

mathematicS
and physics, 10 study physics
and biology, 300
do not study any
of the three subjects

0 Find the number of students

studying all
the three subjects.

Ci)Find the
number of students studying
exactly one of the three
subjects.

SPPU-May 16,6Marks Students

studying exacty 1 subject

Fig. Ex. 1.9.8(a)

Techlnouley
Publicatis
Discrete Mathematics -
(SPPU Comp.) 1-21 SetTheory

In the class of 55
Ex. 1.9.9: students the number of Ex. 1.9.10: 100 were asked whether they play
sportsmen
students studying different
subjects are as
givenbelow which game: Cricket, Hockey, Football. The
resultsare 45 play Cricket, 38 play Hockey
Maths 23,Physics
24,Chemistry 19, Maths 21 play Football, 18 play Cricket and Hockey, 9
Physics 12, Maths+ Chemistry 9,Physics
Chemistry 7, all the three play Cricket and Football, 4 play Footbail
and
subjects 4. Find the
number of students who have taken: Hockey and 23 play none of these.

0 at least one
subject
Draw a Venn diagram that will show the results

(i) exactly one subject

of the survey and determine the number of

Gii) exactly two subjects

sportsmen who play

(0 exactly one of the games

Soln.

Let M SetofstudentsstudyingMathematics Gi) exactly two of the games.

SPPU- Dec.18,6Marks
P Setof students
studying Physics Soln. : Let, C Setof sportsmen playing Cricket
C Set of studentsstudying
Chemistry H Setof sportsmenplaying Hockey
Let us fill
up the various of the Venn
regions F Setof sportsmenplaying Football
diagram.

CUHUF| 23
1CUHUF|= Ul- 1CUHUF
M =100 23 77
We know,
CuHUF| =|C]+|H|+|FI-1CnH
-|CnFI-|HoF|
1. Various regions 2. At least one subject

77 45 +38+21 18-9-4
+1CnHoFI
M 4

(
or 1CnHoFI = 77 104 +31
Let us fill up the various regions of the Venn
diagramn.

3. Exactly one subject 4. Exactly two subjects

22 20

Fig. Ex. 1.9.9

1. Number of students who have taken at least one

12
subject = 6 +8+9+ 5+4+3 +7 42
2. Number of students who have taken exactly one 2. Sportsmen playing exactly
subject 6 +9+7 22 1: Various regions
one of the gameS
22+ 20+12 54
Number of students who have taken exactly two
subjects =5+8+3 16
mnmuinda
 1-22
Discrete Mathematics (SPPU -Comp.)
Step 2:Filling the
remaining
221 20
H
60-18 12-14 16 regions

10
18 12

12
19

3.Sportsmen playing exactly

two the games
5+ 14+0
of

19
30
Fig. Ex. 1.9.10 M 16 18 12

Ex.1.9.11: Among 130 students, 60 study mathematics M 18

51 study physics and 30 study mathematics
C
and physics. Out of 54 students studying
chemistry, 26 study mathematics, 21 study
Studentsstudying biology
12 mathematics and
physics and study both students studying neither
All the students studying neither physics nor mathematics
physics.
30+ =49
mathematics nor physics are studying biology.
19 Students
c
)
studying
mathematicsbut
not
Find Fig. Ex. th

1.9.11(a)
How many are studying biology ? Number of students
(i) How many are studying chemistry and studying neither
nor physics nor chemistry =30.
mathematics but notphysics ?
(ii) How many students arestudying neither Ex. 1.9.12: A survey has been
taken
mathematics nor physics nor chemistry ? Each respondent
ken on
onMot
was asked tomodes
Marks chesi
 Discrete Mathematics (SPPU-Comp) 1-23 Set Theory

in a group of 70 cars tested

by a garage
1.9.13: in a Ex. 1.9.14: A survey on sample 25 new cars being sold out
city, 15 had faulty tyres, 20 had faulty brakes at a local auto dealer was conducted to see
and 18 exceed the allowable emission which
limits. of three popular options Air conditioner

Also, 5 cars had faulty tyres and brakes, 6 (A). Radio (R), Power Windows (w) were
failed on tyres and The 15 had
emission, 10 failed on already installed. survey found air

brakes and emission, and 4 cars conditloners, 12 had radios, and 11 had power
were
unsatisfactory in all three aspects. How many windows, 5 had air conditioner and power

had no windows, 9 has air conditioner and radio, 4 had

faults in these three checks ? Draw an
radio and power windows. Three had all three
appropriate Venn diagram.
options. Find numberof cars which had
Soln.
(0) Only one of the options
T Setof cars with faulty

|
Let, tyres
(i) At least one of the options
BSetof cars with faulty brakes None of the
(il) options.

ESet of cars with emission problem Use principle of inclusion exclusion.

U =70, IT| = 15, Soln.: = 15, R| = 12,

1A|
|B| = 20,
TnB] = 5, IToEI
E| = 18,
= 6,
W = 11, AnWI = 5,
RoW= 4, AnRI=9,
BnE 10, IToBoE| = 4 AnRoWj= 3
We know, We know,
TUBUE| =IT|+|B|+|E|-1ToB| AURU W| = JA|
+ R+ W-A nR- AnW
-|ToE|-IBoE| - RoW+1A nRn WI
+1ToBnE| = 15+12 +11 -5-4-9+3
= 15 +20+18-5-6 10 + 4 23
=57 21 = 36 1. Cars with only one of the options

Cars with no faults

= TUBUE
= 1U -1TUBUE|
70 36
= 34
34 w
8
Fig. Ex. 1.9.14

Result = 4 +2+ 5=11

2. Cars with at least one of the options

with regions
|AURUW| = 23
Venn diagram all

marked 3. Cars with none of the options

Fig. Ex. 1.9.13

=AURUW| =25-23 =2
ETechKnowledge
Pub1catio
 1-24

Discrete Mathematics (SPPU -Comp.

Ex. 1.9.16 : A survey of 500tele
the
Ex.1.9.15: In a survey of 260 college students the following evision
195 information.
following data were obtained watches watchs

94 had 45 watch hockey,

64 had taken mathematics course, football
and
115
58had taken and and wacheN
a computer science course, football
taken
a business course, 28 had taken both
basketball
hockey,
and 50 do
50t
basketban
not
26 had games.
mathematics and business course,
watcn
taken both mathematics and computer science () How many
any t
cOurse, 22 had taken both computer science the three
people nthe
games ?
and business course and 14 had taken all 3 (i) How many
people
sure w
types of courses game?
0 How many students were surveyed who Soln.
had taken none of the three types of
Let, F Set of watchers
courses ? offoothah
() Of the students how
H Setof watchers
surveyed, many had of hocker
taken only a
computer science B Setof key
course watchersof
Soln.
SPPU-May 17,3Marks UH= = 500,
basket

FB 2 ketball

Let, M Set of students who had taken

195,

FoB = 45, 18
B
mathematics
FAH 10
Setof
students who had taken
HnBI= 50,
business course 1.
People watching all
FuHUB=50
the three games
C Setof students who had taken
computer science = FuHUB| = |
MI
CI =
64,

94,
B U
= 58,

260,
U-IFUHUB
500 50
FUHUB

450
MoBI=28, MnCl= 26,
2. Let us draw
Venn
CnBI = 22, 1MnBoC = 14
diagramwith all
region marte

Let us draw a Venn diagram with

marked. all
regions
50
260 H
24 14- 22

64-14-14-12 24 -12-14-8-80 108

581414-8
22

People watching
94
(12+14+8)= exactly one game
60 190+95+40
Fig. Ex.
325
1.9.15

1. Fig. Ex. 1.9.16

Number of students
three types
who had taken none
of the
FUBUH
of courses 106 |F|+|B|+|HH
2. Number of students who had -IFnBI-1FoH
taken
computer science course = 60 only a
or,
450
-BoH+|FoBoH
+
285+195 115-45-70 -50

+IFnBnHI

Techln
Publieatn
 Discrete Mathematics (SPPU- Comp.) 1-25 Set Theory

FoBH = 450+ (45 + 70+50)

Required answer = 500+400
-(285 + 195 + 115) 900

Ex. 60%
450+165-595 =615-595 20
1.9.18: It is known that in university of professors

play tennis, 50% ofthem play bridge, 70%

jog
19.17: In a town there are 2000 20% play tennis and bridge, 40% play bridge
literate person of
them 60 % read news paper A.
and jog and 30% play tennis and
55% read jog

newspaper B and 20% someone claimed that 20% professors jog and
How many individuals
read neither A nor B play tennis and bridge, would you believe his
read
0 Both the A and B ?
claim? Why ? SPPU Dec.13,4Marks
newspaper
Soln.
() Only one
newspaper ?
Let,T set of professorsplaying tennis
SPPU May 13, 6Marks
Soln.
Bsetof professorsplaying bridge
Let NA Set of
persons reading newspaper A.
Jset of professors who jog.
NB Setof persons reading newspaper B.
Let us assume that the number of professors =100
60
= 2000 x 100
INA 1200 IT|=60, B| = 50,
55 1J| 70, ToBI = 20,
and
2000x100 100 1100
JoBI = 40, 1ToJ= 30
= 20
NA U NB 2000xT00 400 Now,

Let us draw the Venn JUTUB|= TI+ B|+ |J - IT n B - J n B

diagram -ITn J+ JoToBI
() Individual

NA| = 1200
NB|=
reading both

1100
A and B

|
Or,

|
1JuTuB| = 60 + 50 + 70 20 40 30 +
JnToB
= 90 +

|
JnToBI
NA n NB INA| +|NB -|NA UNB Conclusion
l
1200 +1100 1600 =700
1. |J UTUB 100 as some professors may not
Required answer =700
belong to any ofthe given sets.

2. 1JnToB|s10 as 90+| JnToB|s100

NA 1200-70071100-700AI
=400
00 Hence, the claim that 20% professorsjog and play
tennis and bridge is wrong.

Fig. Ex. 1.9.17 to eio Ex 1.9.19 During asurvey of the ice cream preferencesof
(i) reading only one newspaper students,it was found that 22 like mango,25
Individuals

like custardapple, 30like grape, 9 like custard

apple andmango, 17like mangoandgrape, 20

likecustardapple and grape, 6 like all flavourS

N 700 NB and 4like none.Thenhowmanystudents were

surveyed ?
How many studentslike exactly oneiavour
how many students like exactly two flavours ?
Ex.
Fig. 1.9.17(a) SPPU -Dec.14, 6Marks

TechKnowledge
uication s
 1-26

A Studentsknowine
Mathematics
(SPPU-Comp) Soln.
B Student knowingCOBOL
'C
Discrete
CStuden nowing Dis
Soln.
who like mango
|UI = 80, PASCAT
Let, M Set of people
wholike
custard
apple
= 55, A The
|B|
ASetof people wholikegrape
GSet of people = 25, AnB== 25
37,
Ba
1A BnC
| M| = 22,

AnM
=9, AnCI 1.1

G = 39,
= 17, AnG = 20, We know
A +|B|+|CCI-AnB
MoG AUBUC|=
-|BnC]+|AnBnc 4

|
= 4

|AUMUG|
MoAnG| 6,
80 50+55 +46-27-28 25 TE

Now,

AUMUG = A|+ |M|+ |G|-|An

M|
oT,

+AnBnC
= TE

/MoG/-1AnG|+ +6
|AnMnG ABoC| 80-151+90

25+22+39-9-17-20 70-15 |=
19
= 92-46 46

= 46
Number ofstudents surveyed answers
to get the
Let us make the Venn diagram
of remaining questions.

46
M

3
Fig. Ex. 1.9.20: Venn diagram will all
regions 1ti

Students, knowing all the three languages =191

Ex. 1.9.19
Fig.
Students, knowing exactly two languages
Number exactly one flavour
ofstudents liking
18 +6 +9 33
= 2+2+8=12
Students, knowing exactly one language
Number of students liking exactly two flavours

= 7+9+ 12 28
= 14 +3 +11 = 28
Ex. 1.9.20: In the first
year computer science class of 80 1.10 Principle of Dualityy
students, 50 COBOL 55 C and
knew The principle of duality state that any esau
stablist

46 PASCAL was also known that

It
5
C and COBOL 28 C and PASCAL, and
25 PASCAL and COBOL
KneW result involving

of unions and
sets and complemen
intersections gives
ents and operaua
a corresp
nt
7
)
result by replacing:
students however knew none of the
language
How many knew all the u by n lunion by intersection]
three languages 7
(i) How many knew exactly two languages ? by intersection by union
Ci) How many knew exactily one
language ? U (universal set)
by
SPPU May 15,4Marks,Dec.15,Dec. 16, 6 Marks
by U (universal set)

Techln
Pubiat
 Set Theory
setThe
- 1-27
Mathematics (SPPU Comp.)
Dsc and n are also called duals of each Multisubset
of B, if
rtae Operators A said to be a multisubset
A multiset is
to its
A
other

46 xample
: Dual of (A

Write dual
u B)n C

of the following
is (AnB)UC
expressions
multiplicity

multiplicity

For example
of

in
each element
B.
in is less or equal

28Ex. a01:
.1.10.
(AUBuC) (A UCn(AU B) 1,2, 2, 3)c (1, 1, 2, 2,2,3)
(i) (Un A) u (BnA)= A Union of multiset
then AUB is the

Soln. f A and B are two multisets

each element x AUB,
e
And The required
dual is, multiset such that for
G) = max [Ha (x),HB
(AnBnC)
=(An C)u(An B)C H (x)

For example
(ii) The required
dual is,
A = (a,b,b, c), B= (b, c, c,d}
If

(A)n(BUA) =A then, AUB = a,b, b, c, c, d

.
1.11 Multiset

What is multiset
SPPU-May 13,2Marks, Dec.
?
13, May 19, 1 Mark
Intersection

If A and
of multisets

B are multisets,
the multiset such that for
x)
then A n B is
each element x e

),HB ())
defined as
An B,

.
min (PA
with at least two
examples
Explain its significance
SPPU Dec.13, 1.Mark For example
2, 3), B= {1, 2, 2, 2, 3,3)
proper set notations and
If A = 1, 1, 1, 2,
{
with
Define Multisets
SPPU Dec. 17,1 Mark nB = 2, 3)
then, A
{ 1, 2,
exampleS
of a set. In a
is a of multisets
A multiset generalization Difference
-B

)
once. A is defined as
an object can occur more than If A and B are multisets, then
x e A- B,
that for each element
IS multiset,
the multiset such
of Multiset with Example
19 1.11.1 Significance a of books in library,
H(x) HA ()-HB
the collection
For example,
of the same book. u(a) gives For example
can contain multiple copies d} and B = {b, c, d, d}
of an element
a'in a set.
If A = la, b, c, c, c,

the multiplicity
then, A-B la,c, c
For example:
Sum of nmultisets
amultiset A and B, A + B is defined as
(a, b, c, c, a} is
For any two multisets

1)a,b, a} is a multiset follows:

olished x e A+B
For each element
Equality of Multiset
is the
cation

occurrence of each element u(x)= HA+HBx)

g dual
f the number of are equal.
then multisets For example
samein both the multiset and B ={2,3,3,31
If
A (1,1, 2,31
For example: 3, 3, 3}
= fa, a, b, a} then, A +B =1,1, 2,2, 3,
a,b, a, a)
but a,b, a) # la, b} Knowledge
Tech Public ations
 1-28
Discrete Mathematics (SPPU- Comp.) SetTh
Soln.
Ex. 1.11.1: find
For glven multisets,
PuQ (a, a, a, b, c, c, d, d
A UB. CnD, A-D, B +D
A (a, a, b, c,d,d,d,e) (ii) Pr :a, a, c)

B fa. b, d, f. o (ii) P-Q la, d, d

C dc e, e, g. h, h) (iv) P+Q la,a, a, a, a, b, c, c, c, d, d)
D a,d, d, e, f, 9. h}
i
f,
For a given muitiset find the
Ex. 1.11.3
Soln. tolo
operations
AUB la,a, b, c, d, d, d, e, f g A (a,a,b,c,d,d.d.ej Bfa,b.d.f.g)
Sylla
CoD e,g,h} Cb.ce.e.g.h.h) D (a,d.d.e.f.lg.h)
A-D {a,b,c,d} Find: 0) AU B CoB
(iv) B D {a, a, b, d, d, d, e, f, f, f, 8. 8. h} (i)A-D
(i)

(v) B+C
Ex. 1.11.2: SPPU May 13,4Ma
Let P and Q be 2 multisets.
Soln.
P{a a, a, c, d,
d) and Q (a., a, b, c. c AUB la, a, b, c, d, d, d, e, f, g}
A
Find: Pua 0 PoQ sen
Gi) P-Q (iv) P+Q
SPPU -May 19,2 Marks
(i)

(ii)

(iv)
A CoB

B+C
D =
(b,g)

la, b, c,

(a,
d]

b,b, c, d, e, e, f, g,g,h, h}
The

tru

Th
Th

camp

Ine

on C
i) Th

2 T
etr
Kam
F
no

i)V
ii)V