If 9 1 + 1 8 1 + 3 0 1 + 4 5 1 + 6 3 1 + ⋯ = n m , where m and n are coprime positive integers, then find m + n .
This problem is a part of the sets Advanced is basic and Summing Sums .
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.
Let S = 3 1 + 6 1 + 1 0 1 + 1 5 1 + 2 1 1 + ⋯ .
Now consider the following sum X = 9 1 + 1 8 1 + 3 0 1 + 4 5 1 + 6 3 1 + ⋯ = 3 1 S .
Taking a factor of 3 1 out we get that, X = 3 1 ( 3 1 + 6 1 + 1 0 1 + 1 5 1 + 2 1 1 + ⋯ ) .
Now rewrite every denominator as such, X = 3 1 ( 3 1 + 2 × 3 1 + 2 × 5 1 + 3 × 5 1 + 3 × 7 1 + 4 × 7 1 + ⋯ ) .
Notice that we can rewrite X as X = 3 1 ( 3 1 × ( 1 + 2 1 ) + 5 1 × ( 2 1 + 3 1 ) + 7 1 × ( 3 1 + 4 1 ) + ⋯ ) .
Then X = 3 1 ( 3 1 × 2 3 + 5 1 × 6 5 + 7 1 × 1 2 7 + ⋯ ) .
Now cancelling out, X = 3 1 ( 2 1 + 6 1 + 1 2 1 + 2 0 1 + 3 0 1 + ⋯ ) .
Finally taking out 2 1 , we get that, X = 3 1 ( 2 1 ( 1 + 3 1 + 6 1 + 1 0 1 + 1 5 1 + 2 1 1 + ⋯ ) ) .
Notice now that, X = 3 1 ( 2 1 ( 1 + S ) ) and that therefore 3 1 S = 3 1 ( 2 1 ( 1 + S ) ) .
We get that, S = 2 1 ( 1 + S ) and ∴ S = 1 . But X = 3 1 S = 3 1 so m = 1 , n = 3 and m + n = 1 + 3 = 4 .
sequence for denominator is 3/2(n^2+3n+2)
Problem Loading...
Note Loading...
Set Loading...
This series can be written as
3 1 ( 3 1 + 6 1 + 1 0 1 + 1 5 1 + . . . ) = 3 1 k = 2 ∑ ∞ n ( n + 1 ) 2 =
3 2 k = 2 ∑ ∞ ( n 1 − n + 1 1 ) = 3 2 ∗ 2 1 = 3 1 ,
where the fact that the last summation was of a telescoping series was used.
Thus m + n = 1 + 3 = 4 .