范德蒙德卷积
形似:
∑
i
=
0
k
(
n
i
)
(
m
k
−
i
)
=
(
n
+
m
k
)
\sum_{i=0}^k\binom ni\binom m{k-i}=\binom {n+m}k
i=0∑k(in)(k−im)=(kn+m)
可以理解为在大小为
n
n
n 和
m
m
m 的两个堆中选择
k
k
k 个物品。
好像是)推论:
∑
i
=
1
n
(
n
i
)
(
n
i
−
1
)
=
(
2
n
n
−
1
)
\sum_{i=1}^n\binom ni\binom {n}{i-1}=\binom {2n}{n-1}
i=1∑n(in)(i−1n)=(n−12n)
证明:
设
k
=
n
−
1
k=n-1
k=n−1 ,则由第一个式子可得:
∑
i
=
0
n
−
1
(
n
i
)
(
n
n
−
1
−
i
)
=
(
2
n
n
−
1
)
∑
i
=
0
n
−
1
(
n
i
)
(
n
n
−
1
−
i
)
=
∑
i
=
0
n
−
1
(
n
i
)
(
n
i
+
1
)
=
∑
i
=
1
n
(
n
i
)
(
n
i
−
1
)
⇒
∑
i
=
1
n
(
n
i
)
(
n
i
−
1
)
=
(
2
n
n
−
1
)
\sum_{i=0}^{n-1}\binom ni\binom n{n-1-i}=\binom {2n}{n-1}\\ \sum_{i=0}^{n-1}\binom ni\binom n{n-1-i}=\sum_{i=0}^{n-1}\binom ni\binom n{i+1}=\sum_{i=1}^{n}\binom ni\binom n{i-1}\\ \Rightarrow\sum_{i=1}^n\binom ni\binom {n}{i-1}=\binom {2n}{n-1}
i=0∑n−1(in)(n−1−in)=(n−12n)i=0∑n−1(in)(n−1−in)=i=0∑n−1(in)(i+1n)=i=1∑n(in)(i−1n)⇒i=1∑n(in)(i−1n)=(n−12n)
其他的推论:
∑
i
=
0
n
(
n
i
)
2
=
∑
i
=
0
n
(
n
i
)
(
n
n
−
i
)
=
(
2
n
n
)
∑
i
=
0
m
(
n
i
)
(
m
i
)
=
∑
i
=
0
m
(
n
i
)
(
m
m
−
i
)
=
(
n
+
m
m
)
\sum_{i=0}^n\binom ni^2=\sum_{i=0}^n\binom ni\binom n{n-i}=\binom {2n}n\\\sum_{i=0}^m\binom ni\binom mi=\sum_{i=0}^m\binom ni\binom m{m-i}=\binom {n+m}m
i=0∑n(in)2=i=0∑n(in)(n−in)=(n2n)i=0∑m(in)(im)=i=0∑m(in)(m−im)=(mn+m)