我校请来了某位厉害的数学老师讲三天组合数学,在此记一些重点知识。以下按照《组合数学》这本书的章节顺序。
由于我太菜,难免有错漏,敬请谅解并告知。
一、什么是组合数学
这一章是介绍了很多组合数学的例子,知识点杂,也比较简单,故跳过。
二、排列和组合
排列组合的性质
记排列数为: p ( n , k ) = n k ‾ = n ! ( n − k ) ! p(n,k)=n^{\underline{k}}=\frac{n!}{(n-k)!} p(n,k)=nk=(n−k)!n!
记组合数为: ( n k ) = n ! k ! ( n − k ) ! \binom n k=\frac{n!}{k!(n-k)!} (kn)=k!(n−k)!n!
1.根据定义有:
p ( n , k ) = k ! ∗ ( n k ) p(n,k)=k!*\binom n k p(n,k)=k!∗(kn)
( n k ) = ( n n − k ) \binom n k=\binom n {n-k} (kn)=(n−kn)
( n k + 1 ) = ( n k ) ∗ n − k k + 1 \binom n {k+1} =\binom n k *\frac{n-k}{k+1} (k+1n)=(kn)∗k+1n−k
( n k ) = ( n − 1 k − 1 ) + ( n − 1 k ) \binom n k=\binom {n-1} {k-1}+\binom {n-1} {k} (kn)=(k−1n−1)+(kn−1)
2.其他性质:
∑ i = 0 n ( n i ) = 2 n \sum_{i=0}^{n}\binom {n} {i}=2^n i=0∑n(in)=2n
理解:大小为n的集合选任意子集,有 2 n 2^n 2n种;
如果枚举子集大小,为左边和式
∑ n = k m ( n k ) = ( m + 1 k + 1 ) \sum_{n=k}^{m}\binom {n} {k}=\binom {m+1} {k+1} n=k∑m(kn)=(k+1m+1)
证明:由 ( n k ) = ( n − 1 k − 1 ) + ( n − 1 k ) \binom n k=\binom {n-1} {k-1}+\binom {n-1} {k} (kn)=(k−1n−1)+(kn−1)得 ( n k ) = ( n + 1 k + 1 ) − ( n k + 1 ) \binom n k=\binom {n+1} {k+1}-\binom {n} {k+1} (kn)=(k+1n+1)−(k+1n)
所以 ∑ n = k m ( n k ) = ∑ n = k m ( n + 1 k + 1 ) − ( n k + 1 ) = ( n + 1 k + 1 ) − ( k k + 1 ) = ( n + 1 k + 1 ) \sum_{n=k}^{m}\binom {n} {k}=\sum_{n=k}^{m}\binom {n+1} {k+1}-\binom {n} {k+1}=\binom {n+1} {k+1}-\binom {k} {k+1}=\binom {n+1} {k+1} ∑n=km(kn)=∑n=km(k+1n+1)−(k+1n)=(k+1n+1)−(k+1k)=(k+1n+1)
( 2 n n ) = ∑ i = 0 n ( n i ) 2 \binom {2n} {n}=\sum_{i=0}^n\binom{n}{i}^2 (n2n)=i=0∑n(in)2
理解:有一个 2 n 2n 2n元素的集合S,从中选出 n n n个数有 ( 2 n n ) \binom{2n}{n} (n2n)种方案,我们把的分为左右两半,枚举左边选几个,方案为 ∑ i = 0 n ( n i ) × ( n n − i ) = ∑ i = 0 n ( n i ) 2 \sum_{i=0}^n\binom{n}{i}\times \binom{n}{n-i} =\sum_{i=0}^n\binom{n}{i}^2 ∑i=0n(in)×(n−in)=∑i=0n(in)2,左右相等。
多重集合排列
即计算可重集 S = { a 1 ∗ 1 , a 2 ∗ 2 , . . . , a n ∗ n } S=\{a_1*1,a_2*2,..., a_n*n\} S={
a1∗1,a2∗2,...,an∗n}的 ∑ i a i \sum_{i}a_i ∑iai(记为 n n n)排列:
可以不管重复全部排一遍,1重复计算了 a 1 ! a_1! a1!次,…k重复计算了 a k a_k ak次,要除掉,答案为: