Introduction to Discrete Mathematics

46
Introduction to Discrete Mathematics Lecture 1: Sep 1

description

Introduction to Discrete Mathematics. Lecture 1: Sep 1. Basic Information. Course homepage : http://www.cse.cuhk.edu.hk/~chi/csc2110/ Newsgroup : cuhk.cse.csc2110. at news.cse.cuhk.edu.hk Instructor : Lau, Lap Chi Office hour : W7 (SHB 911) Lectures : M7-8 (ERB LT), W6 (TYW LT) - PowerPoint PPT Presentation

Transcript of Introduction to Discrete Mathematics

Page 1: Introduction to Discrete Mathematics

Introduction to Discrete Mathematics

Lecture 1: Sep 1

Page 2: Introduction to Discrete Mathematics

Basic Information

Course homepage: http://www.cse.cuhk.edu.hk/~chi/csc2110/

Newsgroup: cuhk.cse.csc2110. at news.cse.cuhk.edu.hk

Instructor: Lau, Lap Chi

Office hour: W7 (SHB 911)

Lectures: M7-8 (ERB LT), W6 (TYW LT)

Tutors: Chan Yuk Hei, Tom Fung Wai Shing, Isaac

Yung Chun Kong, Darek Zhang Zixi, Jesse

Tutorials: H5 (ERB 404) or H6 (EGB 404)

Page 3: Introduction to Discrete Mathematics

Course Material

Textbook: Discrete Mathematics with Applications (DMA)

Author: Susanna S. Epp

Publisher:

Reference: Course notes from “mathematics for computer science”

http://courses.csail.mit.edu/6.042/spring07/

Page 4: Introduction to Discrete Mathematics

Course Requirements

Homework, 20%

Midterm, 30%

Course project, 10%

Final Exam, 40%

Midterm: Oct 27 (Monday), M7-8

Page 5: Introduction to Discrete Mathematics

Course Project

4 students in a group

Pick an interesting mathematical topic,

write a report from 5 to 10 pages.

Can use any references, but cite them.

Choose 3 groups to present, up to 5% bonus

Page 6: Introduction to Discrete Mathematics

Tell an interesting story related to mathematics.

More about good topic and nice presentation, than mathematical difficulty.

A Project

Interesting or curious problems, interesting history

Surprising or elegant solutions

Nice presentation, easy to understand

Page 7: Introduction to Discrete Mathematics

Checker

x=0

Start with any configuration with all men on or below the x-axis.

Page 8: Introduction to Discrete Mathematics

Checker

x=0

Move: jump through your adjacent neighbour, but then your neighbour will disappear.

Page 9: Introduction to Discrete Mathematics

Checker

x=0

Move: jump through your adjacent neighbour, but then your neighbour will disappear.

Page 10: Introduction to Discrete Mathematics

Checker

x=0

Goal: Find an initial configuration with least number of men to jump up to level k.

Page 11: Introduction to Discrete Mathematics

K=1

x=0

2 men.

Page 12: Introduction to Discrete Mathematics

K=2

x=0

Page 13: Introduction to Discrete Mathematics

K=2

x=0

4 men.

Now we have reduced to the k=1 configuration, but one level higher.

Page 14: Introduction to Discrete Mathematics

K=3

x=0

This is the configuration for k=2, so jump two level higher.

Page 15: Introduction to Discrete Mathematics

K=3

x=0

8 men.

Page 16: Introduction to Discrete Mathematics

K=4

x=0

Page 17: Introduction to Discrete Mathematics

K=4

x=0

Page 18: Introduction to Discrete Mathematics

K=4

x=0

Page 19: Introduction to Discrete Mathematics

K=4

x=0

Page 20: Introduction to Discrete Mathematics

K=4

x=0

Now we have reduced to the k=3 configuration, but one level higher

20 men!

Page 21: Introduction to Discrete Mathematics

K=5

a. 39 or below

b. 40-50 men

c. 51-70 men

d. 71- 100 men

e. 101 – 1000 men

f. 1001 or above

Page 22: Introduction to Discrete Mathematics

Example 1

How to play Rubik Cube?

http://blog.sciencenews.org/mathtrek/2007/08/cracking_the_cube.html

Google: Rubik cube in 26 steps

Page 23: Introduction to Discrete Mathematics

Example 2

The mathematics of paper folding

http://erikdemaine.org/foldcut/

http://www.ushistory.org/betsy/flagstar.html

Page 24: Introduction to Discrete Mathematics

http://128.100.68.6/~drorbn/papers/PDI/

Example 3

3D-images

Page 25: Introduction to Discrete Mathematics

Magic tricks

More games, more paper folding, etc

Famous paradoxes

Prime numbers

Game theory

Project Ideas

Deadline: November 17.

http://www.cse.cuhk.edu.hk/~chi/csc2110/project.html

Page 26: Introduction to Discrete Mathematics

Why Mathematics?

Design efficient computer systems.

•How did Google manage to build a fast search engine?

•What is the foundation of internet security?

algorithms, data structures, database,

parallel computing, distributed systems,

cryptography, computer networks…

Logic, number theory, counting, graph theory…

Page 27: Introduction to Discrete Mathematics

Topic 1: Logic and Proofs

Logic: propositional logic, first order logic

Proof: induction, contradiction

How do computers think?

Artificial intelligence, database, circuit, algorithms

Page 28: Introduction to Discrete Mathematics

Topic 2: Number Theory

• Number sequence

• Euclidean algorithm

• Prime number

• Modular arithmetic

Cryptography, coding theory, data structures

Page 29: Introduction to Discrete Mathematics

Topic 3: Counting

• Sets

• Combinations, Permutations, Binomial theorem

• Functions

• Counting by mapping, pigeonhole principle

• Recursions, generating functions

Probability, algorithms, data structures

Page 30: Introduction to Discrete Mathematics

Topic 3: Counting

How many steps are needed to sort n numbers?

Page 31: Introduction to Discrete Mathematics

Topic 4: Graph Theory

• Relations, graphs• Degree sequence, isomorphism, Eulerian graphs• Trees

Computer networks, circuit design, data structures

Page 32: Introduction to Discrete Mathematics

What is discrete mathematics?

logic, sets, functions, relations, etc

Logic: artificial intelligence (AI), database, circuit design

Number theory: cryptography, coding theory

Counting: probability, analysis of algorithm

Graph theory: computer network, data structures

CSC 2100, ERG 2040, CSC 3130, CSC 3160

Page 33: Introduction to Discrete Mathematics

2 2 2a b c

Familiar?

Obvious?

cb

a

Pythagorean theorem

Page 34: Introduction to Discrete Mathematics

cb

a

Rearrange into: (i) a cc square, and then (ii) an aa & a bb square

Good Proof

Page 35: Introduction to Discrete Mathematics

c

cc

a b

c

b-a

Good Proof

Page 36: Introduction to Discrete Mathematics

cb

a b-a

b-a

Good Proof

Page 37: Introduction to Discrete Mathematics

ba

a

ab-a

74 proofs in http://www.cut-the-knot.org/pythagoras/index.shtml

b

Good Proof

Page 38: Introduction to Discrete Mathematics

Bad Proof

Page 39: Introduction to Discrete Mathematics

Statement (Proposition)

Statement is either True or False

Examples:

Non-examples:

Hello.

How are you?

True

False

2 + 2 = 4

3 x 3 = 8

787009911 is a prime

Page 40: Introduction to Discrete Mathematics

Logic Operators

P QQP

NOT::

AND::

P QQP

OR::

Page 41: Introduction to Discrete Mathematics

Compound Statement

p = “it is hot” q = “it is sunny”

It is hot and sunny

It is not hot but sunny

It is neither hot nor sunny

Page 42: Introduction to Discrete Mathematics

Exclusive-Or

coffee “or” tea exclusive-or

How to construct a compound statement for exclusive-or?

p q p q

Page 43: Introduction to Discrete Mathematics

Check by Truth Table

p q

Page 44: Introduction to Discrete Mathematics

Logical Equivalence

Two statements have the same truth table

De Morgan’s Law

De Morgan’s Law

Page 45: Introduction to Discrete Mathematics

Simplifying Statement

A tautology is a statement that is always true.

A contradiction is a statement that is always false.

Page 46: Introduction to Discrete Mathematics

Class Photos! Identify your face and send us your name and nicknames

Two Important Things

http://appsrv.cse.cuhk.edu.hk/~acmprog/web2008/