Figure A1 Square root 2, some 3800 years ago...

The side is 30

30 The diagonal is
42.426389 =
42 + 25/60 + 35/602
51 10
1 24
Ö2 is computed as
35 1 + 24/60 + 51/602 + 10/603
25 = 30547/21000
42 = 1.41421296296296296296
2962962963
Ö2 »1.414213562373095048
8016887242097

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure A2 Square root 2

(0,1) (1,1)

1 Ö2 Is there a
number here?

(0,0) 1 (1,0) (Ö2,0)

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure A3 Fibonacci numbers

1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89,

144, 233, 377, 610, 987, 1597,
2584, 4181, 6765, 10946, 17711,
28657, 46368, 75025, 121393,
196418, 317811, 514229, 832040,
1346269, 2178309, 3524578...

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure A4 Square root 2 is irrational, geometric proof

Ö2 =m/n
2 n2 = m2

m n n

n - (m-n) = 2n-m n

2n-m m-n m-n

n m-n
m

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure S1 Operations with sets

A B A

AÈB AÇB

A B A B

A-B AB

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure S2 Distributivity

B B B
A A A

C C C
A B ÇC AÈ(B ÇC)

B B B
A A A

C C C
AÈB AÈC (AÈB)Ç(AÈC)

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure S3 Elements in a union of finite sets

|AÈB | = |A| + |B| - |AÇB|

A
1 1

1 B 1
1 AÇB 1
11 11 1
11 1
1
11 1 1
1
1

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure S4 Cartesian products

ℝ2=ℝ´ℝ
(x,y)
y

(6,2)
2
(0,0)
O x 6

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure S5 Sets difference discovered by Venn diagrams

B B B
A A A

C C C
A B ÈC A Ç (B ÈC)

B B B
A A A
x

C C C
A ÇB - C A ÇC - B (AÇB - C) Ç (AÇC - B)

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure B0 Relation examples on 

2=´ R R
8
a<b
7
a =b
6 (6,6)
5 (4,5)
4
3 R aRb
2
1
O 1 2 3 4 5 6 7 8

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure B1 Digraphs

2
1 b a

3
4 b
a a

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure B2 Equivalence classes

ℤ [0] [1]
-10 -9 -8 -7 -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7 8 9 10
[0] [1] [2] [3]
-10 -9 -8 -7 -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7 8 9 10

3
4

1 2

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure B3 Pertition

A={1,2,3,4,5}

5 5
{5} ∅
{4,5,1}
3 3
4 4
{3,4} {1}
1
{2,4}
2 1 2
{1,2}
{1,2}

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure B4 Partial order

6 4 4 6
5
4
{1,2,3}
3 3 2 3 5
2
2
1
0 1 {1,2} {1,3} {2,3} 1
-1
-2
-3
{1} {2} {3}
-4
-5
-6
∅

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure B5 Functsions

A B A B
a1 b1 a1 b1
a2 b2 a2
f b2
a3 f a3
b3 b3
a4 b4 a4 b4
b5 A -1 B b5
a1 f
b1
a2 b2
a3 f b3
a4 b4

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure B6 Function graph

)
f(x
y=
(x,f(x))
f(x)

f(x) (x,f(x))

(0,0) x x

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure B7 Function graph, invertible funciton

le
rtib
ve
in

f(x) = y and f -1(y) = x

y
no
y n-
in
ve
rti
bl
e

x1 x2 x3 x

f(x) = y
f -1(y) = ?

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure B8 Cardinality

b =f(a) ℝ
a =g(c)
a
A
O

O c

A a

B
b =f(a)

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure B9 Cardinality

||=|´|
8
7
6 (1,1), (2,1), (2,2), (1,2), (1,3), (2,3),
5 (1,5) (2,5) (3,5) (4,5) (5,5) ...(2,3), (3,3), (3,2), (3,1), (4,1), (4,2),
4 (1,4) (2,4) (3,4) (4,4) (5,4) ...(4,3), (4,4), (3,4), (2,4), (1,4),...
3 (1,3) (2,3) (3,3) (4,3) (5,3)

2 (1,2) (2,2) (3,2) (4,2) (5,2)

1 (1,1) (2,1) (3,1) (4,1) (5,1)

O 1 2 3 4 5 6 7 8

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure B10 Reflexive closure

R2 R3
e Rn k
j f
g
h R4 i
c

R2 x
d
a
b

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure B11 Cardinality

x = 0.a1a2a3a4a5...
y = 0.b1b2b3b4b5...

(0,1) (1,1)
(x,y)

z = 0.a1b1a2b2a3b3a4b4a5b5...

(0,0) (1,0) 0 z 1

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure B12 Cardinality

O (0,1) (1,1)

(0,1) (1,1)
(0,0) (1,0)
a
(0,0) (1,0)

b =f(a)

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure B13 Cardinality

(-1,1) (1,1)
(x,y)

(0,0) (0,0)

(-1,-1) (1,-1)

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure B14 Cardinality

c O

O
ℝ2
ℝ
a
a =g(c)
b =f(a)

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure C1 Permutations

τ
1 1 1 1
2 2 2 2
σ
3 3 1 1 3 3
2 2
3 3

n n

Vahagn H. Mikaelian, AUA Discrete Mathematics

 σ
t
6

u v
2 7
t

8 j
4 u v
3 1 i

9 5 j
k

k
 Figure C3 Pigeonhole principle application

O O

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure C4 Inclusion-exclusion

AÇB B
A
A AÇB B AÇB ÇC

B ÇC
AÇC

C
|AÈB |=|A|+|B|-|AÇB|

|AÈB ÈC |=|A|+|B|+|C|
-|AÇB|-|AÇC|-|B ÇC|
+|AÇB ÇC|

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure C5 Probability sample

3
1

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure C6 Conditional Probability

P(S)=1 S

A A ÇB

P(A|B) =P(A ÇB)/P(B)

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure C7 Boolean algebra on power set

X=1 X=1 X=1

M ÈN M
M N M N M

M ÇN

0=Æ 0=Æ 0=Æ

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure C8 Boolean algebra, De Morgan’s law

X X X

M ÈN M N
M N M N M N
M ÈN

M ÈN =M Ç N

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure G1 Seven Bridges of Königsberg

1 4

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure G2 Map Coloring problem

Armenian
Calculus

Algebra
English

Discrete math.

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure G3 Graph samples

2 3
u v

1 4
v

6 5

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure G4 Graph samples

2 2 3

1 3 2 1 4

2 3
1 3

5 4 1 4

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure G5 Graph samples

2 2 2

1 3 1 3 1
3

5 4 5 4 5 4
2 2 2

1 1

5 5 5
Vahagn H. Mikaelian, AUA Discrete Mathematics
 Figure G6 Induced subgraphs

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure G7 Ramsey’s Theorem

v v

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure G8 Walks in graphs

3
9 W = 1~3~5~8~9
1
5 1~3~2~3~5~6~5~8
2
1~2~4~3~2~5~3~4
8
W -1 = 9~8~5~3~1
closed walk 1~4~6~5~3~1
6
4 7 1
U = 9~8~5~2
W +U= 1~3~5~8~9~8~5~2

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure G9 Component in graph

3
1 9
2 5
10
8 12

6 11
4 7

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure G10 Cut edge and cut vertex

1 2 10
5
cut edge
e
8
3 9

4 6
7
1 2 5
cut vertex
8
3
4 6
7

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure G11 Theorem on components number

a PeQ is an ab path b

e Q
P
u v

T
L Q -1T -1 is an bc path
PL-1 is an ac path

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure G12 Cycles and trees

1 2 5
2
9
8
3
1 3
C5 4 6
C3 C4 7

5 4

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure G13 Trees in forest...

3
2 8 10
11
8 2
1 3 9
1 6 5
7 7 12
5
4
4 6

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure G14 Unique paths in tree

x
e
u
t
u v
y

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure G15 Cut edges in a tree

u e v
u e C b
v
P
a

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure G16 Leaves

vl

w vl -1

v0 w

v1

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure G17 Removing leaves from tree

u v

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure G18 Eulerian graphs

even even even

w e v w
even
v
e

odd
d(a)=1 odd odd odd
a e b
d(a)=1 even b
a e c

Vahagn H. Mikaelian, AUA Discrete Mathematics

 Figure G19 Eulerian graphs

odd odd
odd
a b odd b
P a P
e e
even
c even c

odd
a
e P
odd b

Vahagn H. Mikaelian, AUA Discrete Mathematics