HMMT 二月 2006 · 冲刺赛 · 第 37 题
HMMT February 2006 — Guts Round — Problem 37
题目详情
英文原题
- [15] Computen 3 2
2 · ( n + 7 n + 14 n + 8)
n =1
解析
英文解析
- Compute
∞
∑
2 n + 5
n 3 2
2 · ( n + 7 n + 14 n + 8)
n =1
Answer: − 8 ln 2137
Solution: First, we manipulate using partial fractions and telescoping:24
( )
∞ ∞
∑ ∑
2 n + 5 1 1 2 1 1 = · − −
n 3 2 n
2 · ( n + 7 n + 14 n + 8) 2 2 n + 1 n + 2 n + 4
n =1 n =1
∞
∑
1 1 1 = −
4 2 2 · ( n + 4)nn =1
∑
∞nr
Now, consider the function f ( r, k ) := . We havekn =1
[ ]n
∞ ∞ ∞
n n n − 1
∑ ∑ ∑
∂f ( r, k ) ∂ r ∂ r r 1 = = = = f ( r, k − 1)
k k k − 1
∂r ∂r n ∂r n n rn =1 n =1 n =1
∞
∑ndf ( r, 1) 1 r 1 r 1 = = · =
dr r n r 1 − r 1 − r 0
n =1
∫
f ( r, 1) = = − ln(1 − r ) + f (0 , 1)dr
1 − r
( )
∑
∞
1 1
By inspection, f (0 , 1) = 0, so f , 1 = = ln(2). It is easy to compute thenn =1
2 n · 2
( )
∑
∞
1 1 131
desired sum in terms of f , 1 , and we find = 16 ln(2) − . Hence, ournn =1
2 2 ( n +4) 12
final answer is − 8 ln(2).137
24