Scribd
Upload
35 views

Discrete Mathematics II: 12 Lectures For Part IA CST 2012/13

This document outlines the topics to be covered in a 12-lecture course on Discrete Mathematics II. It introduces some of the key motivations and topics from Discrete Mathematics I that will provide context. The course will cover logical notation, the principle of mathematical induction, definition by mathematical induction, sets, and set laws over the course of 2 chapters. Specific readings, examples, and exercises are provided for the first chapter on logical notation and mathematical induction.

Uploaded by

Joe Hicks
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
35 views

Discrete Mathematics II: 12 Lectures For Part IA CST 2012/13

This document outlines the topics to be covered in a 12-lecture course on Discrete Mathematics II. It introduces some of the key motivations and topics from Discrete Mathematics I that will provide context. The course will cover logical notation, the principle of mathematical induction, definition by mathematical induction, sets, and set laws over the course of 2 chapters. Specific readings, examples, and exercises are provided for the first chapter on logical notation and mathematical induction.

Uploaded by

Joe Hicks
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

Discrete Mathematics II

12 lectures for Part IA CST 2012/13

Marcelo Fiore

Course web page: http://www.cl.cam.ac.uk/teaching/1213/DiscMathII/

/1

Motivations
Circuits in hardware Datatypes in programming languages Formal languages in compilers Relations in databases Graphs in algorithms Counting in discrete probability Proof in program correctness Type systems Computability
/2

Discrete Mathematics I
Propositional logic. Predicate logic. Proof. Set theory. Induction.

/3

Chapter 1
Reading list: 1.1 Logical notation 1.2 Patterns of proof 1.3 Mathematical induction The principle of mathematical induction Denition by mathematical induction Tower of Hanoi Suggested exercises: 1.5, 1.7.

/4

Logical Notation
P Q , P & Q , P and Q P Q , P or Q P Q , P implies Q , if P then Q P Q , P iff Q P , P does not hold

/5

x. P (x) , for all x, P (x) ,

x1 , . . . , xn . P(x1 , . . . , xn );
x. P (x) , there exists x such that P (x) ,

x1 , . . . , xn . P(x1 , . . . , xn )
!x. P (x) , there exists a unique x such that P (x)

/6

Principle of Mathematical Induction


To show a property P(k) for all k ranging over the natural numbers, that is to prove k N0 . P(k) by the principle of mathematical induction we proceed as follows: 1. We show the property for 0; that is we prove P(0) 2. We show that if the property holds for an arbitrary number then it will also hold for its successor; that is we prove n N0 . P(n) P(n + 1)

/7

Example: P(k) =def


k i=0

i=

k(k+1) 2

/8

Definition by Mathematical Induction


To dene a function f ranging over the natural numbers; that is, to dene values f(k) for all k N0 one may
dene the value f(0) of the function f at 0; that is,

set f(0) = b
dene the value for f(n + 1) in terms of the values n

and f(n); that is set f(n + 1) = h n, f(n)


/9

Example: Tower of Hanoi T (0) , if n = 0 T (n) =def 2 T (n 1) + 1 , if n N

/10

Chapter 2
Reading list: 2.1 Sets 2.2 Set laws Suggested exercises: 2.2, 2.8

/11

Sets
Sets and classes are unordered collections.

Examples: , N, N0 , Z, Q, R.

/12

Comprehension:

{ x | P(x) } , { x X | P(x) }

/13

You might also like