由于某种原因这篇文章到现在才被发出来。其实本质上是容斥，虽然我之前一直不是很理解这个容斥。- 给定 k ∈ N k \in \mathbb N k∈N，则存在以下关系式： g k = ∑ i = k n ( i k ) f i ⇔ f k = ∑ i = k n ( − 1 ) i − k ( i k ) g i g_k = \sum \limits_{i = k}^{n} \binom{i}{k}f_i \Leftrightarrow f_k = \sum \limits_{i = k}^{n} (-1)^{i - k} \binom{i}{k}g_i gk=i=k∑n(ki)fi⇔fk=i=k∑n(−1)i−k(ki)gi
- 证明：
∑ i = k n ( − 1 ) i − k ( i k ) g i = ∑ i = k n ( − 1 ) i − k ( i k ) ∑ j = i n ( j i ) f j = ∑ j = k n f j ∑ i = k j ( − 1 ) i − k ( i k ) ( j i ) = ∑ j = k n f j ∑ i = k j ( − 1 ) i − k ( j k ) ( j − k i − k ) = ∑ j = k n ( j k ) f j ∑ i = 0 j − k ( − 1 ) i ( j − k i ) = ∑ j = k n ( j k ) f j ( 1 − 1 ) j − k \begin{aligned} \sum \limits_{i = k}^{n} (-1)^{i - k} \binom{i}{k}g_i &= \sum \limits_{i = k}^{n}(-1)^{i - k} \binom{i}{k} \sum \limits_{j = i}^{n} \binom{j}{i} f_j \\ &= \sum \limits_{j = k}^{n} f_j\sum \limits_{i = k}^{j} (-1)^{i - k} \binom{i}{k}\binom{j}{i}\\ &= \sum \limits_{j = k}^{n} f_j\sum \limits_{i = k}^{j} (-1)^{i - k} \binom{j}{k}\binom{j - k}{i - k}\\ &= \sum \limits_{j = k}^{n} \binom{j}{k} f_j \sum \limits_{i = 0}^{j - k} (-1)^{i} \binom{j - k}{i}\\ &= \sum \limits_{j = k}^{n} \binom{j}{k} f_j (1 - 1)^{j - k}\\ \end{aligned} i=k∑n(−1)i−k(ki)gi=i=k∑n(−1)i−k(ki)j=i∑n(ij)fj=j=k∑nfji=k∑j(−1)i−k(ki)(ij)=j=k∑nfji=k∑j(−1)i−k(kj)(i−kj−k)=j=k∑n(kj)fji=0∑j−k(−1)i(ij−k)=j=k∑n(kj)fj(1−1)j−k - 当且仅当 j = k j = k j=k 时， ( 1 − 1 ) j − k (1 - 1)^{j - k} (1−1)j−k 为 1 1 1，其余情况下均为 0 0 0。
- 所以原式即为 f k f_k fk。
评论
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
查看更多评论
添加红包
