离散数学杨争锋ch044.pptxVIP

(2) Theorem 1 The Binomial Theorem (page 327) (x+y)n = ∑j=0 n C(n,j) xn-j yj=C(n,0)xn + C(n,1)xn-1y + C(n,2)xn-2y2 + ……………….. + C(n,n-1)xyn-1 + C(n,n) 牛牛文库文档分享Proof: 当乘积被展开时其中的项都是下述形式：xn-jyj, j=0,1,2, …, n。为计数形如xn-jyj的项数，观察到必须从n个和中选n-j个x（从而乘积中其他的j个项都是y）才能得到这种项。因此， xn-jyj的系数是 C(n,n-j)=C(n,j) 定理得证。 牛牛文库文档分享 (3) Example (page 328) (a) Example 2 What is the expansion of (x+y)4?Solution:(x+y)4= ∑j=0 n C(4,j) x4-j yj= C(4,0)x4 + C(4,1)x3y + C(4,2)x2y2 + C(4,3)xy3 + C(4,4)y4=x4 + 4x3y + 6x2y2 + 4xy3 + 牛牛文库文档分享 (b) Example 4 What is the coefficient of x12y13 in the expansion of (x+y)25?Solution: C(25,13) = 25! / (13! ×12!) 牛牛文库文档分享 (c) Example 4 What is the coefficient of x12y13 in the expansion of (2x-3y)25?Solution: (2x+(-3y))25= ∑j=0 25 C(25,j) (2x)25-j (-3y)jThe coefficient of x12y13 is C(25,12) 212 (-3)13 = - 25!/(13!×12!) 212313 牛牛文库文档分享 (4) Corollary 1 Let n be a nonnegative integer. The ∑k=0 n C(n,k) = 2nProof: 2n = (1+1)n = ∑k=0 n C(n,k) 1k 1n-k = ∑k=0 n C(n,k) 牛牛文库文档分享 (5) Corollary 2 Let n be a positive integer. Then ∑k=0 n (-1)k C(n,k) = 0Proof: 0 = 0n = ((-1) + 1)n = ∑k=0 n (-1)k 1n-k = ∑k=0 n (-1)k C(n,k) 牛牛文库文档分享 Remark: Corollary 2 implies that C(n,0) + C(n,2) + C(n,4) + ……. = C(n,1) + C(n,3) + C(n,5) + ……. 牛牛文库文档分享 (6) Corollary 3 Let n be a nonnegative integer. Then ∑k=0 n C(n,k) 2k = 3nProof: (1+2)n = ∑k=0 n C(n,k) 1n-k 2k = ∑k=0 n C(n,k) 2 牛牛文库文档分享 2. Pascal’s Identity and Triangle (1) Pascal’s Identity Let n and k be positive integers with n≥k. Then C(n+1,k) = C(n,k-1) + C(n,k)Proof: 假设T是一个含有n+1个元素的集合，令a是T中的一个元素，且S=T-{a}。注意到T的包含k个元素的子集有C(n+1,k)个。然而T的含k个元素的子集或者包含a和S中的k-1个元素，或者不包含a但包含S中的k个元素。由于S的k-1元素子集有C(n,k-1)个，故T含a在内的k元素子集有C(n,k-1)个。又由于S的k元素子集有C(n,k)个，故T的不含a的k元子集有C(n,k)个。从而可得： C(n+1,k) = C(n,k-1) + C(n,k) 牛牛文库文档分享 Remark: Pascal’s Identity, together with the initial conditions C(n,0)=C(n,n)=1 for all integers n, can be used to recursively define the binomial 牛牛文库文档分享 (2) Pascal’s Triangle 1 1 1 1 2 1 1 3