南京大学《离散数学》课件-第14章递归数列及函数“增长”.docxVIP

第十四章 递归数列及函数“增长” 离散数学教学组 南京大学 回顾 回顾 鸽笼原理 基本的原理 一般的鸽笼原理 运用的例子 排列与组合 基本的排列组合 组合与二项式系数 有重复的排列组合 提要 提要 递归数列 函数“增长” 递归思维：例 1 递归思维：例 1 汉诺塔问题: How many moves are need to move all the disks to the third peg by moving only one at a time and never placing a disk on top of a smaller one. void hanoi(int n,char one, two, three) // 将n个盘从one座借助two座,移到three座 { void move(char x,char y); if(n==1) then move(one,three); else { T(1) = 1T(n) = 2T(n-1) +1 T(1) = 1 T(n) = 2T(n-1) +1 } } 汉诺塔问题的解 汉诺塔问题的解 T(n) = 2T(n-1) + 12T(n-1) = 4T(n-2) + 2 T(n) = 2T(n-1) + 1 2T(n-1) = 4T(n-2) + 2 4T(n-2) = 8T(n-3) + 4 ……. 2n-2T(2) = 2n-1T(1) + 2n-2 递归思维：例 2 递归思维：例 2 Cutting the plane How many sections can be generated at most by n straight lines with infinite length？ Intersecting all Intersecting all n-1 existing lines to get as most sections as possible Line n L(0) = 1 L(n) = L(n-1) +n Solution of Cutting the Plane L(n) = L(n-1)+n L(n) = L(n-1)+n = L(n-2)+(n-1)+n = L(n-3)+(n-2)+(n-1)+n = …… = L(0)+1+2+……+(n-2)+(n-1)+n L(n) = n(n+1)/2 + 1 递归思维：例 3 Josephus Problem Live or die, it’s a problem! Legend has it that Josephus wouldnt have lived to become famous without his mathematical talents. During the Jewish Roman war, he was among a band of 41 Jewish rebels trapped in a cave by the Romans. Preferring suicide to capture, the rebels decided to form a circle and, proceeding around it, to kill every third remaining person until no one was left. But Josephus, along with an unindicted co-conspirator, wanted none of this suicide nonsense; so he quickly calculated where he and his friend should stand in the vicious circle. We use a simpler version: “every second...” Make a Try: for n=10 1 10 2 1 9 3 4 9 3 8 7 6 5 9  1 7 5 3 5survivor 5 7 For 2n Persons (n=1,2,3,... ) 2n 1 2 2n-12n 2n-1 2n-3 1 3 5 n persons left k+3 k-1 k+1 k+1 k k-1 The The solution is: newnumber (J(n)) ......2k-1And the newnumber( ...... 2k-1 And What about 2n+1 Persons (n=1,2,3,... ) 2n+1 1 2 2n+12 2n+1 2n-1 3 5 7 do the same: n person