离6散数学课件(英文版)----counting.pptVIP

* * * * * * * * * * * * * * * * * * * * * Thinking Recursively: Problem 1 Towers of Hanoi 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. T(1) = 1 T(n) = 2T(n-1) +1 Solution of Towers of Hanoi 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 T(n) = 2n-1 Thinking Recursively: Problem 2 Cutting the plane How many sections can be generated at most by n straight lines with infinite length. Line n Intersecting all n-1 existing lines to get as most sections as p