第14讲特殊的数.pptVIP

第14讲 特殊的数 （Special Number）;主要内容;Fibonacci Number;Leonardo Fibonacci 1175-1250 ;Fibonacci number Golden Section;Fibonacci Numbers in Nature;Ordinary field daisies (雏菊) have 34 petals;The association of Fibonacci numbers and plants is not restricted to numbers of petals. ;If we draw horizontal lines through the axils, we can detect obvious stages of development in the plant. ;The number of branches at any stage of development is a Fibonacci number. ;Furthermore, the number of leaves in any stage will also be a Fibonacci number. ;sunflowers （向日葵）;13;14;15;Fibonacci in geometrical style;HDOJ 1848 ;Lucas Number;Edouard Lucas ;Question:;空间换时 间！！;Catalan number;先看一道题目：;示意图：; The Catalan numbers (1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786, 208012, 742900, 2674440, 9694845, ...), named after Eugène Charles Catalan, arise in a number of problems in combinatorics. They can be computed using this formula: ;Eugène Charles Catalan;What can the Catalan numbers describe ?;1. The number of ways a polygon with n+2 sides can be cut into n triangles ;5 sides, 5 ways: ;7 sides, 42 ways:;2. the number of ways in which parentheses can be placed in a sequence of numbers to be multiplied, two at a time ; 5 numbers:;3. the number of paths of length 2n through an n-by-n grid that do not rise above the main diagonal ;3 x 3 grid: ;4. The number of binary trees with n nodes. ;5. Some other applications;(3) The recurring sequence c[0]=1, (n+2)c[n+1] = (4n+2)c[n], (n=0). (4)Another disguise is the number of ways n votes can come in for each of two candidates A and B in an election, with A never behind B.;思考(1)：/showproblem.php?pid=1133;算法分析：;(3)其他情况： 考虑（m+n）个人排队购票的情景，第（m+n）人站在第（m+n-1）个人的后面，则第（m+n ）个人的排队方式可以由下列两种情况获得： 1）第（m+n ）个人手持￥100的钞票，则在他之前的(m+n-1）个人中有m个人手持￥50的钞票，有（n-1）个人手持￥100的钞票，此种情况共有f(m,n-1); 2)第（m+n ）个人手持￥50的钞票，则在他之前的(m+n-1）个人中有m-1个人手持￥50的钞票，有n个人手持￥100的钞票，此种情况共有f(m-1,n);;根据加法原理得到 f(m,n)=f(m-1,n)+f(m,n-1) 于是得到f(m,n)的计算公式;计算示意图：;计算示意图：;计算示意图：;可以推出??接的公式：;课后作业：