Set & Counting Techniques

1) Basic Definitions:

Definition:
x

a and
set A an elements of se

·
If a
belongs to is
an element of) A:x EA

·
If doesn't belong:
I
a GA

Definition:
*

Empty set is the setwith no objects (elements of members).

↳ denoted

The number of elements in

* the
a setis
cardinality of the
set,
denoted n(A)

Ex: .
the set of real roots of
A is 0, nCA) 1
= =

·
is the set
A of prime numbers smaller than 10, nCA) 4
=

to
↳
so'nguyen
·
A is the set of positive integer roots (x, y, z) of equation
+
x
y z
= "(k),3)

A
* is subset of B, denoted Ac B, if UxEA
a we have a B.
If there exist stA and ce EB, then AkB

A
* Venn
diagram is a
diagramthat shows all logical
relations between a finite collection of different sets.
Ex:nCU) 90 = students n(G) 35
=

good
n(F) 50
=
females nCA) 20 attractive =

10 good Females (GF), 10 attractive females (AF)

5
good & attractive students (GAU), 1 good & attractive females (GAF)
F
G

31 I
21

1
I
4

2) Set operations

*Complements:
A=[nEU a * A3

Relative with respect to B

of A
*
complement

B-A = [cetu / atB and ne Al

Ex:U is the set of positive integers from 1 to 10, A is the set of odd
numbers smaller than 10. Bis the set of prime numbers smaller than 10

·
u [1,2,3, .,103
=
. .

·
A (13,5,7,93
=

·
B 32,3,5,73
=

·
32,4,6,8,10]
A= "Latex"
·
B (1,4,6,8,9,10]
=

·
A -

B 31,93
=
 Union:Let
* A, B be 2 subsets of U. The union of A and
B,
denoted AUB is defined as follow:
AUB =
[atUlrEAoratB3

Intersection:Let
* be 2 subsets of 4. The intersection of A and B,
A,B
denoted An B is defined as follow:
ArB = 3 nEn lxtAandaEBY

EX: ·
AUB 3
=
1,2,3,5,7,9]
·
ArB 93,5,73
=

A
=>
- B AlB2
=

De
* Morgan's law:Al, A2, ....
As are subsets of U.

CA U A2 U... UAK) =As Az" ...

As

CA1A2 ... Ax) Al U Ae U...WAK2

=

Ex:Determine Ain BC and AUBUC

cAubics (Anna)
* Proposition:(Inclusion -
Exclusion Rule of 2 sets)
Given 2 sets A and B with number
finite
nCAUBY n
= (A) nCB)
+
-
nCAB)

C I of 3 sets]

n 2AUBUC n(A) nCB) =

+
+ nCC) -

nCAnB) nCBrc) nCAnC)

-
-

+
nCAnBrC)
C I of 4 sets]
n(AUBUCUD) nCA) nC) nCC) n2D) nCAMB) nCBrC)
=
+ + +
- -

nC(nD) nCAD) + nCAnrc) nCAnrD) +nCBrcnD)

- +
 + nCABrCnD)
Ex:1000 patients,
each patient has atleast 1symptom.
-> nCAUBUC) n() 1000 = =

900 have either

symptom A orB => n(AUB) 900
-

-
900 I/ A.or -> n (AUC) 900 =

-
s00 / BorC -> n (BUC) 800 =

-650 have
symptom -> nCA) 650
A =

500 Il B n(B) 500

=
=

550 I 2 -> n(2) 55) =

-> nCAB) ?, nCAUB-C)

= = ?, nCAB1C) =?

(1) nCAB) n(A) = nCB)

+ -
nCAVB) 650 500
=
+
-
900 250
=

(2) nCAUBIC) n(U) =

-
n(2) 1000
=
-

550 450 =