Tuesday, March 13, 2018

summation - Determine infinite sum with shifting binomial coefficients




I am looking for a way to find analytically the following sum



i=016i(i+ki)=(65)1+k,



for some integer k>0. The answer I displayed here was found by Wolfram Alpha. I looked at partial sums, but it involves hypergeometric functions. Is there any way around this? Many thanks in advance.


Answer




Note that F(k+1)=1+i1(i+k+1i)16i =1+i1((i+ki)+(i+ki1))16i =1+i1(i+ki)16i+i1(i+ki1)16i =i0(i+ki)16i+16i0(i+k+1i)16i =F(k)+F(k+1)6 hence F(k+1)=65F(k) and since F(1)=i0(i+1i)16i=i0i+16i=(65)2 we have F(k+1)=(65)k+2.


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...