I started to read some book on elementary number theory and preliminary chapter asks to establish some formulas by mathematical induction:
There is this formula:
1+2+...+n=n(n+1)2
And this one:
1⋅2+2⋅3+...+n⋅(n+1)=n(n+1)(n+2)3
With some pencil-and-paper work I established that this should hold:
1⋅2⋅...⋅m+2⋅3⋅...⋅(m+1)+...+n⋅(n+1)⋅...⋅(n+m−1)=n(n+1)...(n+m−1)(n+m)m+1
I did not prove this formula that I established but just checked some cases and it seems to hold.
It can be written in the form of a hockey-stick identity, I think, so it holds.
Now, I know about generalization of first formula that goes like this (Faulhaber´s formula):
1w+2w+...+nw=1w+1⋅w∑j=0(w+1j)Bjnw+1−j
How do the generalization (1⋅2⋅...⋅m)w+(2⋅3⋅...⋅(m+1))w+...+(n⋅(n+1)+⋅...⋅(n+m−1))w=? look like? That is, what is on the right side?
No comments:
Post a Comment