chapter6 recurrence.pptVIP

6. Advanced Counting Techniques 6.1 Recurrence Relations 6.2 Solving Recurrence Relations 6.3 Divide-and-Conquer Algorithms and Recurrence Relations 6.4 Generating Functions 6.5 Inclusion-Exclusion 6.6 Applications of Inclusion-Exclusion 6.1 Recurrence Relations 微生物每個小時增加一倍，可用 an+1 = an 來表示。一開始微生物量為 a0。 令 an 代表長度為 n 的二元字串中不包含連續兩個 0 的字串個數，則 an+1 = an + an-1，且 a1 = 2, a2 = 3。 Definition 1 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 solutions of a recurrence relation if its terms satisfy the recurrence relation. Example 1 Let {an} be a sequence that satisfies the recurrence relation an = an-1 – an-2 for n = 2, 3, 4, … and suppose that a0 = 3 and a1 = 5. What are a2 and a3 ? Example 2 Determine whether the sequence {an} is a solution of the recurrence relation an = 2an-1 – an-2 for n = 2, 3, 4, …, where an = 3n for every nonnegative integer n. Answer the same question where an = 2n and where an = 5. Initial conditions 給足夠的 initial conditions 就可以決定惟一解。 Example 3 [Compound interest] Suppose that a person deposits(存) $10,000 in a savings account at a bank yielding 11% per year with interest compounded(複利) annually(每年). How much will be in the account after 30 years ? Example 4 [Rabbits and the Fibonacci Numbers] A young pair of rabbits(one of each sex) is placed on an island. A pair of rabbits does not breed until they are 2 months old. After they are 2 months old, each pair of rabbits produces another pair each month, as shown in Figure 1. Find a recurrence relation for the number of pairs of rabbits on the island after n months, assuming that no rabbits ever die. Rabbits and Fibonacci Numbers Example 5 [The Tower of Hanoi] A popular puzzle of the late nineteenth century invented by the French mathematician Edouard Lucas, called the Tower of Hanoi, consists of thre