~advancedcountingtechniques.pptVIP

* College of Computer Science Technology, BUPT -- ? Copyright 2001~2003 Yang Juan Note Sometimes properties of a recurrence relation are useful to know. Because of the close connection between recurrence (recursion) and mathematical induction, proofs of these properties by induction are common. * College of Computer Science Technology, BUPT -- ? Copyright 2001~2003 Yang Juan Example For the Fibonacci numbers , This gives a bound on how fast the Fibonacci numbers grow. Proof (by strong induction) BS: Here n0 is 1. P(l) is l ?5/3 and this is clearly true. Induction St