自然数幂和

自然数幂和

$O(k^2)$递推做法

首先令$S(n,k)={\sum }_{i=1}^n{i}^k$，那么我们把$S(n,k+1)$给拆开，可以得到如下的方程：
$$\begin{array}{rl}S(n,k+1)& =\sum _{i=1}^n{i}^{k+1}\\ S(n,k+1)& =\sum _{i=2}^n(i-1+1{)}^{k+1}+1\\ S(n,k+1)& =\sum _{j=0}^{k+1}\left(\genfrac{}{}{0ex}{}{k+1}{j}\right)\sum _{i=1}^{n-1}{i}^j+1\\ S(n,k+1)& =\sum _{j=0}^{k+1}\left(\genfrac{}{}{0ex}{}{k+1}{j}\right)(S(n,j)-n^j)+1\\ S(n,k+1)& =\sum _{j=0}^{k-1}\left(\genfrac{}{}{0ex}{}{k+1}{j}\right)(S(n,j)-n^j)+(k+1)(S(n,k)-n^k)+(S(n,k+1)-n^{k+1})+1\\ (k+1)S(n,k)& =n^{k+1}+(k+1)n^k-1-\sum _{j=0}^{k-1}\left(\genfrac{}{}{0ex}{}{k+1}{j}\right)(S(n,j)-n^j)\\ S(n,k)& =\frac{n^{k+1}-{\sum }_{j=0}^{k-1}\left(\genfrac{}{}{0ex}{}{k+1}{j}\right)(S(n,j)-n^j)-1}{k+1}+n^k\end{array}$$
那么就可以递推了。

$O(k^2)$预处理，单次计算$O(k)$

首先有第二类斯特林数普通幂转下降幂：$x^k={\sum }_{i=0}^k\left\{\begin{array}{c}n\\ i\end{array}\right\}{x}^{\underline{i}}$。

把$S(n,k)$拆开：
$$\begin{array}{rl}S(n,k)& =\sum _{i=1}^n{i}^k\\ & =\sum _{i=1}^n\sum _{j=0}^k\left\{\begin{array}{c}k\\ j\end{array}\right\}{i}^{\underline{j}}\\ & =\sum _{j=0}^k\left\{\begin{array}{c}k\\ j\end{array}\right\}\sum _{i=1}^n{i}^{\underline{j}}\\ & =\sum _{j=0}^k\left\{\begin{array}{c}k\\ j\end{array}\right\}\sum _{i=1}^n\frac{(i+1{)}^{\underline{j+1}}-i^{\underline{j+1}}}{j+1}\\ & =\sum _{j=0}^k\left\{\begin{array}{c}k\\ j\end{array}\right\}\frac{(n+1{)}^{\underline{j+1}}-1}{j+1}\end{array}$$
于是就可以轻松的计算了。

$O(k\log k)$预处理出同一个$n$的$1$至$k$次自然数幂和

还是推式子：
$$\sum _{i=1}^n{i}^k=\sum _{i=0}^n{e}^{ix}[\frac{x^k}{k!}]-[k=0]=[\frac{x^k}{k!}]\frac{e^{(n+1)x}-1}{e^x-1}-[k=0]$$
上面这个式子关于$e$的项直接展开即可，然后多项式求逆搞一下就没了。