Module #17Recurrence Relations.ppt

1/8/01 (c)2001-2003, Michael P. Frank Discrete Mathematics and its Applications (c)2001-2002, Michael P. Frank Module #17:Recurrence Relations Rosen 5th ed., §6.1-6.3 ~29 slides, ~1.5 lecture §6.1: Recurrence Relations A recurrence relation (R.R., or just recurrence) for a sequence {an} is an equation that expresses an in terms of one or more previous elements a0, …, an?1 of the sequence, for all n≥n0. A recursive definition, without the base cases. A particular sequence (described non-recursively) is said to solve the given recurrence relation if it is consistent with the definition of the recurrence. A given recurrence relation may have many solutions. Recurrence Relation Example Consider the recurrence relation an = 2an?1 ? an?2 (n≥2). Which of the following are solutions? an = 3n an = 2n an = 5 Example Applications Recurrence relation for growth of a bank account with P% interest per given period: Mn = Mn?1 + (P/100)Mn?1 Growth of a population in which each organism yields 1 new one every period starting 2 periods after its birth. Pn = Pn?1 + Pn?2 (Fibonacci relation) Solving Compound Interest RR Mn = Mn?1 + (P/100)Mn?1 = (1 + P/100) Mn?1 = r Mn?1 (let r = 1 + P/100) = r (r Mn?2) = r·r·(r Mn?3) …and so on to… = rn M0 Tower of Hanoi Example Problem: Get all disks from peg 1 to peg 2. Only move 1 disk at a time. Never set a larger disk on a smaller one. Hanoi Recurrence Relation Let Hn = # moves for a stack of n disks. Optimal strategy: Move top n?1 disks to spare peg. (Hn?1 moves) Move bottom disk. (1 move) Move top n?1 to bottom disk. (Hn?1 moves) Note: Hn = 2Hn?1 + 1 Solving Tower of Hanoi RR Hn = 2 Hn?1 + 1 = 2 (2 Hn?2 + 1) + 1 = 22 Hn?2 + 2 + 1 = 22(2 Hn?3 + 1) + 2 + 1 = 23 Hn?3 + 22 + 2 + 1 … = 2n?1 H1 + 2n?2 + … + 2 + 1 = 2n?1 + 2n?2 + … + 2 + 1 (since H1 = 1) = = 2n ? 1 §6.2: Solving Recurrences A linear homogeneous recurrence of degree k with constant coefficients (“k-LiHoReCoCo”) is a recurrence of the f