At math competitions, I often see a problem along the lines of "Let S=n=1∑∞2nn2. Find S." and notice that not that many people are able to solve it (the answer is 6). I'm going to show how to solve that kind of problem in this note.
The first thing we need to do is to find the value of n=1∑∞knn for some ∣k∣>1. We can solve this with some clever manipulation and summation of geometric series. Recall that n=0∑∞abn=1−ba for ∣b∣<1.
n=1∑∞knn=k1+k22+k33+k44+=k1+k21+k31+k41++k21+k31+k41++k31+k41++k41+……………⋱
We can see that each line we have created is a summable geometric series. Let's see what happens when we sum each line. Let sx=n=x∑∞kn1.
s1=k1+k21+k31+k41+…s2=k21+k31+k41+…s3=k31+k41+…s4=k41+…=n=1∑∞kn1=1−k1k1=k−11=n=2∑∞kn1=1−k1k21=k2−k1=n=3∑∞kn1=1−k1k31=k3−k21=n=4∑∞kn1=1−k1k41=k4−k31⋮
We can notice two things from this. First, our original problem can be rewritten as finding x=1∑∞sx. Also, sx+1=ksx. This means that {s1,s2,s3…} is a geometric series.
x=1∑∞sx=s1+s2+s3+…=k−11+k2−k1+k3−k21+…=1−k1k−11=(k−1)2k
So what does this mean for our original problem? After all, this only gives us a way to find n=1∑∞2nn, not n=1∑∞2nn2. Fortunately, we can make that leap with some nice index shifting.
First - what is index shifting? Index shifting is the technique of saying that i=a∑bxi=i=a−c∑b−cxi+c. For example, i=1∑∞2i1=i=0∑∞2i+11. Now let's find a general formula for S=n=1∑∞knn2 to demonstrate how we can apply this technique.
n=1∑∞knn2=n=0∑∞kn+1(n+1)2=n=0∑∞kn+1n2+n=0∑∞kn+12n+n=0∑∞kn+11=n=1∑∞kn+1n2+n=1∑∞kn+12n+n=1∑∞kn1
That last step may seem a little strange, but take a look at what happens when n=0 in each sum.
In the first two sums, the n=0 term has a numerator of 0, meaning that the n=0 term is equal to 0. Thus, we can get rid of it and start the sum at the n=1 term. In the third sum, the n=0 term is not equal to 0, we can just index shift the n=0 out.
n=1∑∞kn+1n2+n=1∑∞kn+12n+n=1∑∞kn1=k1n=1∑∞knn2+k2n=1∑∞knn+n=1∑∞kn1
We have simplified the problem enough to solve for S.
SS(kk−1)S=kS+k2×(k−1)2k+k−11=(k−1)22+(k−1)2k−1=(k−1)2k+1=(k−1)3k(k+1)
You can use similar techniques to find higher order sums, though problems going past n=1∑∞knn4 are trolls.
Here is a helpful list for sums of order ≤6
n=1∑∞kn1n=1∑∞knnn=1∑∞knn2n=1∑∞knn3n=1∑∞knn4n=1∑∞knn5n=1∑∞knn6=k−11=(k−1)2k=(k−1)3k(k+1)=(k−1)4k(k2+4k+1)=(k−1)5k(k3+11k2+11k+1)=(k−1)6k(k4+26k3+66k2+26k+1)=(k−1)7k(k5+57k4+302k3+302k2+57k+1)
It should be noted that n=1∑∞knnx=(k−1)x+1kAn(k) where An(k) is the nth Eulerian polynomial.
I hope this helped you out! Best of luck solving these kinds of problems!
#Algebra
#Series
#Summation
#GeometricSequence
#TrevorsTips
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Check this PolyLogarithm
That's simply Brilliant , Trevor
Log in to reply
Thanks @Azhaghu Roopesh M! I'm glad it helps.
Nice algebraic method; I mostly use calculus for these sorts but this was an eye-opener.
Very nice note!
Amazing Man !!!
These questions are what I call Arithmetic Geometric Progression. I started a wiki page on it, but it is still a work in progress. Help would be appreciated!
Log in to reply
@Trevor B. We've made several edits to the Arithmetic-Geometric Progression wiki page. Can you look over it and see if there are any improvements?
Thanks a lot for the note. It helped a lot.
Thanks!!!!!!