说明:一般情况下\(0^0 = 1\)
对所有的非负整数\(k\)和\(n\)定义的二项式系数\(\binom{n}{k}\),
如果\(k > n\),则\(\binom{n}{k} = 0\),
对所有的\(n\),\(\binom{n}{0} = 1\),
如果\(n\)是是一个正整数,且\(1 \le k \le b\),则\(\binom{n}{k} = \frac{n!}{k! (n - k)!} = \frac{n (n - 1) \cdots (n - k + 1)}{k (k - 1) \cdots 1}\)
有以下一些性质成立
\(\binom{n}{k} = \binom{n}{n - k} \tag{1}\)
显然
Pascal公式
\(\binom{n}{k} = \binom{n - 1}{k} + \binom{n - 1}{k - 1} \tag{2}\)
根据定义或组合意义可证
\(\binom{n}{0} + \binom{n}{1} + \cdots + \binom{n}{n} = 2^n \ \ \ \ \ \ (n \ge 0) \tag{3}\)
可用有关二进制的组合意义理解
二项式定理
若\(n\)是正整数,对于所有的\(x, y\)有\((x + y)^n = \sum\limits_{k = 0}^n \binom{n}{k} x^{n - k} y^k \tag{4}\)
数学归纳即可
特殊情况
当\(x = y = 1\),即可推出\((3)\)
当\(y = 1\),有\((x + 1)^n = \sum\limits_{k = 0}^n \binom{n}{k} x^k = \sum\limits_{k = 0}^n \binom{n}{n - k} x^k \tag{5}\)
当\(x = 1, y = -1\),推出
\(\sum\limits_{k = 0}^n (-1)^k \binom{n}{k} = \binom{n}{0} - \binom{n}{1} + \binom{n}{2} - \cdots + (-1)^n \binom{n}{n} = 0 \ \ \ \ \ (n \ge 1) \tag{6}\)
结合\((3)\)即可得\(\binom{n}{0} + \binom{n}{2} + \cdots = \binom{n}{1} + \binom{n}{3} + \cdots = 2^{n - 1} \ \ \ \ \ (n \ge 1) \tag{7}\)
\(k \binom{n}{k} = n \binom{n - 1}{k - 1} \ \ \ \ \ (n,k都是正整数) \tag{8}\)
根据定义可证
\(\sum\limits_{k = 1}^n k\binom{n}{k} = n 2^{n - 1} \ \ \ \ \ (n \ge 1) \tag{9}\)
证明一:
令\(s = 0 \binom{n}{0} + \binom{n}{1} + 2 \binom{n}{2} + \cdots + n \binom{n}{n}\),
将所有项反转,得\(s = n \binom{n}{n} + \cdots + 2 \binom{n}{2} + \binom{n}{1} + 0 \binom{n}{0}\),
由\((1)\),两式相加得\(2s = n \sum\limits_{k = 0}^n \binom{n}{k} = n 2^n\),所以\(s = n 2^{n - 1}\)
证明二:
根据\((8)\)和\((3)\)可得\(\sum\limits_{k = 0}^n k\binom{n}{k} = \sum\limits_{k = 1}^n n\binom{n - 1}{k - 1} = n \sum\limits_{k = 0}^{n - 1} \binom{n - 1}{k} = n 2^{n - 1}\)
证明三:
对\((x + 1)^n = \sum\limits_{k = 0}^n \binom{n}{k} x^k \ \ \ \ \ (5)\)两边关于\(x\)求导,可得\(n (x + 1)^{n - 1} = \sum\limits_{k = 1}^n k \binom{n}{k} x^{k - 1}\)
代入\(x = 1\)即可
\(\sum\limits_{k = 1}^n k^2 \binom{n}{k} = n (n + 1) 2^{n - 2} \tag{10}\)
原文:https://www.cnblogs.com/tkandi/p/10481174.html