《离散数学》杨争锋ch06-1幻灯片资料.pptVIP

Chapter 7 Advanced Counting Techniques §7.1 Recurrence Relations §7.2 Solving Recurrence Relations §7.3 Divide-and-Conquer Algorithms and Recurrence Relations §7.4 Generating Functions §7.5 Inclusion-Exclusion §7.6 Applications of Inclusion-Exclusion (2) Definition 1 (page 450) A recurrence relation (递推关系) for the sequence {an} is an equation that expresses an in terms of one or more of the previous terms of the sequence, namely, a0, a1, …, an-1, for all integers n with n≥n0, where n0 is a nonnegative integer. A sequence is called a solution of a recurrence relation i