Maybe this is a stupid question but please guide and enlighten me patiently. I have just known something fact that quite shocking me. Let start from this simple fact
n∑k=1k=n(n+1)2
The summation above is a sum of arithmetic progression with common difference of 1 and I have already known it. Then, it turns out (I realized these when playing with Wolfram|Alpha)
n∑k=1k(k+1)=n(n+1)(n+2)3n∑k=1k(k+1)(k+2)=n(n+1)(n+2)(n+3)4n∑k=1k(k+1)(k+2)(k+3)=n(n+1)(n+2)(n+3)(n+4)5
and it seems (I haven't proved it yet)
n∑k=1k(k+1)(k+2)⋯(k+r)=n(n+1)(n+2)(n+3)(n+4)⋯(n+r+1)r+2
We have an obvious pattern here. I know the intuition of (1), but I am wondering what are the intuitutions for the other sums: (2),(3),(4),(5)?
I can derive (2) using well-known formulas for arithmetic series and square pyramidal number, but how do the other formulas, (3),(4),(5), derive? Does it use Faulhaber's formula?
No comments:
Post a Comment