离散数学杨争锋ch061.pptxVIP

§7.1 Recurrence Relations (递推关系)Introduction (1) Example 0 (page 449) The number of bacteria (细菌) in a colony (生物群体) doubles every hour? If a colony begins with five bacteria, how many will be presented in n hours?Solution: anthe number of bacteria at the end of n hoursThe relationship: an=2an-1, where n∈Z+ We can give the initial condition: a0=5. 牛牛文库文档分享2. Recurrence Relations (1) Example 1 (page 450) 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? Solution: Use the recurrence relation and the initial condition. a2 = a1-a0 =5-3 = 2 a3 = a2-a1 =2-5 = -3 牛牛文库文档分享 (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 if its terms satisfy the recurrence 牛牛文库文档分享 (3) 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, an=2n and an=5 respectively.Solution: (i) 2an-1 – an-2=2(3(n-1)) - 3(n-2)=3n= 牛牛文库文档分享 (4) Initial Condition (page 450) The initial condition for a sequence specify the terms that precede the first term where the recurrence relation takes effect. For instance, in Example 1, a0=3 and a1=5 are the initial conditions. The recurrence relation and initial conditions uniquely determine a 牛牛文库文档分享3. Modeling with Recurrence Relation (1) Example 3 (page 451) Please read it by yourself. 牛牛文库文档分享 (2) Example 4 (Rabbits and Fibonacci Numbers, page 451)A young pair of rabbit (one of each sex) is placed on an island. A pair of rabbit does not breed (繁殖) until they are 2 months old. After two months old, each pair of rabbits produce another pair of rab