Sunday, March 17, 2019

convergence divergence - Closed form of :Sn,m=sumnk=1(1)kbinomnkkm!



I don't succed to get a closed form of the bellow sum using standard Binomial law , in order to know if this sum could be converge or not for n+ ,is there any simple way or any algorithm to eavaluate the bellow sum :



Sn,m=nk=1(1)k(nk)km!

?


Answer



The convergence of Sn,m can easily be determined when applying the so-called Dilcher's fromula



1n1nMnMj=11nj=nk=1(nk)(1)k1kM,



where M,nN (for more detail, see http://mathworld.wolfram.com/DilchersFormula.html).




Finally, set M=m!, mN, to obtain



Sn,m=1n1nm!nm!j=11njnk=11k.



Consequently, one deduces that Sn,m as n.



No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...