Service from Sungkyunkwan University BK21 Math Modeling HRD Division, Copyright
Discrete Mathematics Lecture notes 2010 fall semester 
2.1 Mathematical Systems, Direct Proofs, and Counterexample 2.2. More Methods of Proof 2.4 Mathematical Induction 2.5 Strong Form of Induction and the WellOrdering Property 
Review & etc. 
3.1 Functions 3.2 Sequences, and Strings 3.3 Relations 3.4 Equivalence Relations 3.5 Matrices of Relations

7.1 Introduction 7.2 Solving Recurrence Relations 
Natanael_DM_4week Korean Thanksgiving Day 
8.1 Introduction 8.2 Paths and Cycles 8.3 Hamiltonian Cycles and the Traveling Salesperson Problem 
Natanael_DM_5week Kung Fu_tzu's Birthday 
8.4 A ShortestPath Algorithm 8.5 Representations of Graphs 8.6 Isomorphisms of Graphs 8.7 Planar Graphs 9.1 Introduction 9.2 Terminology and Characterizations of Tree 
4.1 Introduction 4.2 Examples of Algorithms 4.3 Analysis of Algorithms 4.4 Recursive Algorithms 5.1 Divisors 5.2 Representations of Integers and Integer Algorithms 5.3 The Euclidean Algorithm 
9.1 Introduction 9.2 Terminology and Characterizations of Tree 9.3 Spanning Trees 9.4 Minimal Spanning Trees 9.5 Binary Trees 9.7 Decision Trees and the Minimum Time for Sorting 9.8 Isomorphisms of Trees 
6.1 Basic Principles 6.2 Permutations and Combinations 6.3 Generalized Permutations and Combinations 6.4 Algorithms for Generating Permutations and Combinations 6.5 Introduction to Discrete Probability 6.6 Discrete Probability Theory 6.7 Binomial Coefficients and Combinational Identities 6.8 The Pigeonhole Principle 
10.1 Introduction 11.1 Combinatorial Circuits 11.5 Applications

+Midterm Exam  +Final Exam 