I’m not sure where I got this question from. It asks for the value of the infinite sum:

31×2×3+52×3×4+73×4×5+

Have a go if you’d like; spoilers are below the line.

The first thing I would do is work out the general term. The numerators are going up by two each time, so I reckon it’s 2k+1k(k+1)(k+2), and we want

S=k=12k+1k(k+1)k+2.

How do we get that? Partial fractions look like they might be our friend.

It turns out that it’s a bit less messy to work out 2S.

  • 4k+2k(k+1)(k+2)=Ak+Bk+1+Ck+2
  • 4k+2=A(k+1)(k+2)+Bk(k+2)+Ck(k+1) [*]

Aside: let’s solve this two ways

First way: simultaneous equations. I don’t much care for this way, but it seems that some do.

Matching coefficients:

  • [k2]: 0=A+B+C
  • [k]:4=3A+2B+C
  • [1]:2=2A

This gives us A=1 immediately, with B=2 and C=3 close behind.

Alternatively, we can substitute any numbers we like into [*] and get:

  • [k=0]: 2=A
  • [k=1]:2=B, so B=2
  • [k=2]:6=2C, so C=3, as before.

Back to the question at hand

So, 2S=k=1(1k+2k+13k+2).

Let’s write out a few terms of that:

k          
1 11 22 33    
2 . 12 23 34  
3 . . 13 24 35

It’s hopefully quite clear that the terms with a denominator of 3 sum to zero, and so will the terms with a denominator of 4, 5 and so on.

All we’re left with are the denominators of 1 (which sum to 1) and 2 (which sum to 32), so 2S=52 and S=54.

Alternatively

We could use generating functions. It’s massively overkill, but it’s a good excuse to use the technique. Let’s imagine that our sum is in fact a function of x, S(x)=k=12k+1k(k+1)k+2xk.

We can reuse our partial fractions and rewrite that as 2S(x)=k=1(xkk+2xkk+13xkk+2)

And what we have there are three logarithmic series. Let’s examin them in turn:

  • k=1xkk=x1+x22+x33+
  • =ln(1x).

  • k=12xkk+1=2(x2+x23+x34+)
  • =2x(ln(1x)+x).

  • k=13xkk+2=3(x3+x24+x35)

This one’s a bit trickier. I would start with ln(1x)=x+x22+x33+ and think “I want to get rid of the first couple of terms and divide by x2”, giving me…

  • =3(ln(1x)+x+x22x2)
  • or more nicely, 32x2(2ln(1x)+2x+x2)

So, altogether, 2S(x)=32x2(2ln(1x)+2x+x2)2x(ln(1x)+x)ln(1x).

That screams “regroup!” at me. I’m going to turn the whole thing into a single fraction:

  • 2S(x)=(6ln(1x)+6x+3x2)(4xln(1x)+4x)2x2ln(1x)2x2
  • =(64x2x2)ln(1x)+3x2+2x2x2

We’re interested in the value of this when x=1, although there’s a little technical difficulty: this is undefined when x=1, because ln(0) is not a number.

Fortunately, the factor in front of the logarithm also evaluater to zero, and limz0zln(z)=0 1

So, in the limit, we’re left with 2S(1)3+22, so S(1)54 as before.

I’m absolutely not saying that the generating functions way is easier, but the technique is an interesting and wide-ranging one. Try applying it to your favourite difficult sequences today!

Footnotes:

1. Prove this, if you’d like to.