离散数学(二) .pptVIP

Discrete Mathematics Shandong University Qilu Software College Chapter 5 Counting §5.1 The basics of counting (1) 5.1.1 Basic counting principles §5.1 The basics of counting (2) §5.1 The basics of counting (3) 4.1.1 Basic counting principles §5.1 The basics of counting (4) 5.1.1 Basic counting principles §5.1 The basics of counting (5) 5.1.1 Basic counting principles §5.1 The basics of counting (6) 5.1.2 More complex counting problems §5.2 The Pigeonhole principle (1) 5.2.1 Introduction §5.2 The Pigeonhole principle (2) 5.2.2 The generalized Pigeonhole principle §5.2 The Pigeonhole principle (3) 5.2.2 The generalized Pigeonhole principle §5.2 The Pigeonhole principle (4) §5.2 The Pigeonhole principle (5) 5.2.3 Some elegant applications of the pigeonhole principle §5.2 The Pigeonhole principle (6) 5.2.3 Some elegant applications of the pigeonhole principle §5.2 The Pigeonhole principle (7) 5.2.3 Some elegant applications of the pigeonhole principle §5.3 Permutations and Combinations (1) 5.3.1 Permutations §5.3 Permutations and Combinations (2) 5.3.1 Permutations §5.3 Permutations and Combinations (3) 5.3.1 Permutations §5.3 Permutations and Combinations (4) 5.3.1 Permutations §5.3 Permutations and Combinations (5) §5.3 Permutations and Combinations (6) §7.2 Solving Recurrence Relations (12) 7.2.3 Linear nonhomogeneous recurrence relations with constant coefficients A linear nonhomogeneous recurrence relation with constant coefficients is a recurrence relation of the form an=c1an-1+c2an-2+…+ckan-k+F(n) where c1,c2,…ck are real numbers and F(n) is a function not identically zero depending only on n. The recurrence relaton an=c1an-1+c2an-2+…+ckan-k , is called the associated homogeneous recurrence relation . §7.2 Solving Recurrence Relations (13) Example: §7.2 Solving Recurrence Relations (14) 7.2.3 Linear nonhomogeneous recurrence relations with constant coeffic