0% found this document useful (0 votes)
20 views10 pages

Discrete Math Intro

The document introduces discrete mathematics and provides examples of its applications. Discrete mathematics includes topics like logic, sets, functions, counting, graph theory, and number theory. It has many uses in computer science, such as designing algorithms, data structures, databases, cryptography, and computer networks. The document then outlines some of the specific topics within discrete mathematics and their relevance to fields like artificial intelligence, probability, circuit design, and more.

Uploaded by

Gear Arellano II
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
20 views10 pages

Discrete Math Intro

The document introduces discrete mathematics and provides examples of its applications. Discrete mathematics includes topics like logic, sets, functions, counting, graph theory, and number theory. It has many uses in computer science, such as designing algorithms, data structures, databases, cryptography, and computer networks. The document then outlines some of the specific topics within discrete mathematics and their relevance to fields like artificial intelligence, probability, circuit design, and more.

Uploaded by

Gear Arellano II
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 10

Why Discrete Math?

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, sets/functions, counting, graph theory…


What is discrete mathematics?

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

Counting: probability, analysis of algorithm

Graph theory: computer network, data structures

Number theory: cryptography, coding theory

logic, sets, functions, relations, etc


Topic 1: Logic and Proofs

How do computers think?

Logic: propositional logic, first order logic

Proof: induction, contradiction

Artificial intelligence, database, circuit, algorithms


Topic 2: Counting

• Sets
• Combinations, Permutations, Binomial theorem
• Functions
• Counting by mapping, pigeonhole principle
• Recursions, generating functions

Probability, algorithms, data structures


Topic 2: Counting

How many steps are needed to sort n numbers?


Topic 3: Graph Theory

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

Computer networks, circuit design, data structures


Topic 4: Number Theory

• Number sequence
• Euclidean algorithm
• Prime number
• Modular arithmetic

Cryptography, coding theory, data structures


Pythagorean theorem

b c

a
a b c
2 2 2

Familiar?
Obvious?
Good Proof

b c

Rearrange into: (i) a cc square, and then


(ii) an aa & a bb square
Good Proof

c c

a b
c

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

You might also like