|
5 | added 48 characters in body | ||
|
We have proved that the limit of $\sum_{k=0}^n r^2k^m / (1+r)^{k+1}$ when n approaches infinity is $\sum_{k=1}^m S(m,k)k!/r^{k-1}$ where S(m,k) is the second kind of stirling number. Is there a simple asymptotic or approximate formula for the result $\sum_{k=1}^m S(m,k)k!/r^{k-1}$ with $m$ fixed and $r$ near $1$. ? |
||||
|
|
4 | deleted 5 characters in body | ||
|
We have proved that the limit of $\sum_{k=0}^n r^2k^m / (1+r)^{k+1}$ when n approaches infinity is $\sum_{k=1}^m S(m,k)k!/r^{k-1}$ where S(m,k) is the second kind of stirling number. Is there a more simple asymptotic formula for the result $\sum_{k=1}^m S(m,k)k!/r^{k-1}$ ? |
||||
|
|
3 | added 10 characters in body; added 34 characters in body | ||
|
We have proved that the limit of $r^2 * k^m \sum_{k=0}^n r^2k^m / (1+r)^(k+1)$ is $\sum_{k=1}^m S(m,k)k!/r^(k-1)$ 1+r)^{k+1}$ when n approaches infinity is $\sum_{k=1}^m S(m,k)k!/r^{k-1}$ where S(m,k) is the second kind of stirling number. Is there a more simple asymptotic formula for the result $\sum_{k=1}^m S(m,k)k!/r^{k-1}$ ? |
||||
|
2 | added 4 characters in body; deleted 35 characters in body; added 17 characters in body | ||
|
|
1 |
|
||
