（lecture_10）特殊的數(shù)-全文預(yù)覽
【正文】 )) 4) 5) ((((1 2) 3) 4) 5) 2020/6/30 37 number of rooted, trivalent trees with n+1 nodes 3 nodes: 2020/6/30 38 5 nodes: 4 nodes: 2020/6/30 39 4. the number of paths of length 2n through an nbyn grid that do not rise above the main diagonal 2 x 2 grid: 2020/6/30 40 3 x 3 grid: 4 x 4 grid: 2020/6/30 41 5. 不同形態(tài)二叉樹的數(shù)目 There are 5 binary trees with 3 nodes. 2020/6/30 42 6. 其它應(yīng)用 （ 1） The number of ways 2n people, seated round a table, can shake hands in n pairs, without their arms crossing. （ 2） The selfconvolving sequence, c[0]=1, c[n+1] = c[0]c[n] + c[1]c[n1] + ... + c[n]c[0] 2020/6/30 43 (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 e in for each of two candidates A and B
教學(xué)課件相關(guān)推薦
鄂ICP備17016276號-1