S = 1 0 1 × 2 2 + 1 0 2 2 × 3 2 + 1 0 3 3 × 4 2 + 1 0 4 4 × 5 2 + ⋯
If S is in the form B A , where A and B are coprime positive integers, find the value of A + B .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
A purely algebraic method: S = n = 1 ∑ ∞ 1 0 n n ( n + 1 ) 2 Note that 1 0 n + 1 ( n + 1 ) ( n + 2 ) 2 − 1 0 n + 1 n ( n + 1 ) 2 = 1 0 n + 1 ( n + 1 ) ( 3 n + 4 ) We subtract 1 0 1 S from S to get S − 1 0 1 S = 5 2 + n = 1 ∑ ∞ 1 0 n + 1 ( n + 1 ) ( 3 n + 4 ) Let x = n = 1 ∑ ∞ 1 0 n + 1 ( n + 1 ) ( 3 n + 4 ) . Using the same method and infinite G.P. formula, x − 1 0 1 x = 5 0 7 + n = 1 ∑ ∞ 1 0 n + 2 6 n + 1 0 = 5 0 7 + n = 1 ∑ ∞ 1 0 n + 2 1 0 + n = 1 ∑ ∞ 1 0 n + 2 6 n ⇒ 1 0 9 x = 5 0 7 + 9 0 1 + n = 1 ∑ ∞ 1 0 n + 2 6 n Let y = n = 1 ∑ ∞ 1 0 n + 2 6 n Using the method a third and final time together with the G.P. formula, y − 1 0 1 y = 1 0 3 6 + 1 0 4 6 + 1 0 5 6 + … = 9 0 0 6 = 1 5 0 1 Now we can solve for S from the 3 equations 1 0 9 S = 5 2 + x , 1 0 9 x = 5 0 7 + 9 0 1 + y and 1 0 9 y = 1 5 0 1 to get S = 2 1 8 7 1 4 0 0 . The required answer is then 1 4 0 0 + 2 1 8 7 = 3 5 8 7
S = n = 1 ∑ ∞ 1 0 n n ( n + 1 ) 2 = n = 1 ∑ ∞ 1 0 n n 3 + 2 n 2 + n = n = 1 ∑ ∞ 1 0 n n 3 + 2 n = 1 ∑ ∞ 1 0 n n 2 + n = 1 ∑ ∞ 1 0 n n
Using the known expressions of the polylogarithm we find: S = L i − 3 ( 1 0 1 ) + 2 L i − 2 ( 1 0 1 ) + L i − 1 ( 1 0 1 ) = 2 1 8 7 1 4 0 0
Huh, I didn't know that these sums had a name attached to them. Thanks for mentioning that. :)
Log in to reply
yeah i only knew simple logarithms before this solution ! thanks for mentioning :)
Log in to reply
No problem.
Also note my solution assumes convergence, look at Brian's solution for both proof of convergence and proof of the polylogarith expressions I used.
Log in to reply
@Isaac Buckley – Once again thanks for mentioning! . well i will like to explore this polylogarithm more !
Problem Loading...
Note Loading...
Set Loading...
First note that 1 0 S = n = 2 ∑ ∞ 1 0 n ( n − 1 ) × n 2 < n = 2 ∑ ∞ 1 0 n n 3 , a series which converges by the ratio test , implying that S must converge as well. We are thus free to rearrange the terms of S without changing its value.
We can then state that
1 0 S = n = 2 ∑ ∞ 1 0 n n 3 − n = 2 ∑ ∞ 1 0 n n 2 = ( n = 1 ∑ ∞ 1 0 n n 3 − 1 0 1 ) − ( n = 1 ∑ ∞ 1 0 n n 2 − 1 0 1 ) = n = 1 ∑ ∞ 1 0 n n 3 − n = 1 ∑ ∞ 1 0 n n 2 .
Next, we will make use of the fact that n = 0 ∑ ∞ x n = 1 − x 1 for ∣ x ∣ < 1 .
Differentiating this equation, (the LHS term-by-term), we find that
n = 1 ∑ ∞ n x n − 1 = ( 1 − x ) 2 1 ⟹ n = 1 ∑ ∞ n x n = ( 1 − x ) 2 x .
Differentiating this last equation, (the LHS again term-by-term), we find that
n = 1 ∑ ∞ n 2 x n − 1 = ( 1 − x ) 3 1 + x ⟹ n = 1 ∑ ∞ n 2 x n = ( 1 − x ) 3 x 2 + x , (equation I).
Differentiating one last time, we find that
n = 1 ∑ ∞ n 3 x n − 1 = ( 1 − x ) 4 x 2 + 4 x + 1 ⟹ n = 1 ∑ ∞ n 3 x n = ( 1 − x ) 4 x 3 + 4 x 2 + x , (equation II).
So by plugging in x = 1 0 1 into equations I and II, we see that
1 0 S = ( 1 − 1 0 1 ) 4 1 0 0 0 1 + 1 0 0 4 + 1 0 1 − ( 1 − 1 0 1 ) 3 1 0 0 1 + 1 0 1 = 9 4 1 0 4 ∗ 1 0 3 1 4 1 − 9 3 1 0 3 ∗ 1 0 0 1 1 = 9 4 1 4 1 0 − 9 3 1 1 0 = 6 5 6 1 4 2 0 = 2 1 8 7 1 4 0 .
Thus S = 2 1 8 7 1 4 0 0 , and so A + B = 1 4 0 0 + 2 1 8 7 = 3 5 8 7 .