Evaluating k-a to k+2a for Limit Sum of k*(p^k)*C

  • Thread starter Thread starter bogdan
  • Start date Start date
  • Tags Tags
    Limit Sum
AI Thread Summary
The discussion focuses on evaluating the limit sum of k*(p^k)*C as n approaches infinity, specifically from k = -a to k + 2a, with parameters 0 < p < 1 and a > 0. Participants suggest manipulating the k coefficient to simplify the sum, using derivatives with respect to p. The transformation involves shifting the index of summation to facilitate calculations, leading to a standard summation form. There's a consensus that while a closed-form solution for the sum T(p) is likely available, its exact value remains elusive for some contributors. The conversation highlights the complexity of combinatorial sums and the need for deeper understanding in this area.
bogdan
Messages
188
Reaction score
0
_____n__________k+a
lim sum k*(p^k)*C = ?
___k=-a_________k+2*a
n->infinity

0<p<1
a>0
 
Last edited:
Mathematics news on Phys.org
Sorry bogdan I can't read it. Maybe better to write it down, scan it and post the image...
 
it's sum from -a to infinity of

k*(p^k)*(k+2*a)!/[(k+a)!*a!], where k goes from -a to infinity...

a>0;a->integer;0<p<1;

Got it ?
 
Ok!

First step is to get rid of that ungainly k coefficient. Use the manipulations:

k pk = p (k pk-1)
= p (d/dp) (pk)

So letting S be the sum of interest:

S(p) = p (d/dp) &sum pk (k+2a)! / (a! (k+a)!)

The next step is to shift the sum over to 0..&infin by letting k+a = i:

S(p) = p (d/dp) &sum pi-a (i+a)! / (a! i!)
(i = 0 .. &infin)

Factor out the p-a:

S(p) = p (d/dp) (p-a &sum pi (i + a)! / (a! i!) )

What's left is, I think, a fairly standard summation, but I'll be darned if I can remember its value, so I'll have to compute it again:

T(p) = &sum pi (i+a)! / (a! i!)

Use the identity:

(d/dp)a pi+a = (i+a)!/i! pa

T(p) = (d/dp)a &sum pi+a / i!
= (d/dp)a (pa &sum pi/i!)
= (d/dp)a (pa ep)

So if you know exactly what a is, you can compute T(p) from here, and plug its value into S(p).


However, I'm 99% sure you can do much better, and that the sum T(p) has a nice closed form solution you can plug into S(p)... I just can't remember it.

Hurkyl
 
Hurkyl...you're a genius...
(if the solution is correct...because I don't fully understand it...)
Anyway, thanks...my combinatorics skills are so pathetic...
Unfortunately...even though I have that result...it's quite complicated to finish it...and I'm not too happy because that sum is strictly related to a...oh...no...that's a good thing...:smile:
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Thread 'Unit Circle Double Angle Derivations'
Here I made a terrible mistake of assuming this to be an equilateral triangle and set 2sinx=1 => x=pi/6. Although this did derive the double angle formulas it also led into a terrible mess trying to find all the combinations of sides. I must have been tired and just assumed 6x=180 and 2sinx=1. By that time, I was so mindset that I nearly scolded a person for even saying 90-x. I wonder if this is a case of biased observation that seeks to dis credit me like Jesus of Nazareth since in reality...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Back
Top