7.1~7.2-advanced counting techniques.pptVIP

下载本文档

3
0
约 45页
2016-08-22 发布于河南
举报
版权申诉

7.1~7.2-advanced counting techniques.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

7.1~7.2-advanced counting techniques

* 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 Step: We use P(j), j ? k to show P(k + l): * College of Computer Science Technology, BUPT -- ? Copyright 2001~2003 Yang Juan Consider the left-hand side of P(k+1): Q.E.D. * College of Computer Science Technology, BUPT -- ? Copyright 2001~2003 Yang Juan The Case of Degenerate Roots Now, what if the C.E. r2 ? c1r ? c2 = 0 has only 1 root r0? Theorem 2: Then, an = α1r0n + α2nr0n, for all n≥0,for some constants α1, α2. * College of Computer Science Technology, BUPT -- ? Copyright 2001~2003 Yang Juan Example 5 Find solution of recurrence relation an = 6an-1 -9an-2 with initial condition a0=1, a1=6 The only root of r2 - 6r + 9 = 0 is r = 3. Hence an = ?13n + ?2n3n From initial conditions, a0=1=?1, a1=6=?1*3+?2*3 ?1 = 1 and ?2 = 1 Therefore, an = 3n + n3n * College of Computer Science Technology, BUPT -- ? Copyright 2001~2003 Yang Juan k-LiHoReCoCos Consider a k-LiHoReCoCo: It’s C.E. is: Thm.3: If this has k distinct roots ri, then the solutions to the recurrence are of the form: for all n≥0, where the αi are constants. * College of Computer Science Technology, BUPT -- ? Copyright 2001~2003 Yang Juan Example 6 Find the solution to the recurrence relation an=6an-1-11 an-2+6an-3with the initial condition a0=2,a1=5, and a2=15 * College of Computer Science Technology, BUPT -- ? Copyright 2001~2003