Evaluate:
k = 1 ∑ ∞ k ( − 1 ) k − 1 n = 0 ∑ ∞ 2 n k + 1 1 .
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.
Probably, a comment to the effect that ∣ ∣ ∣ ∣ k ( − 1 ) k + 1 2 n k + 1 1 ∣ ∣ ∣ ∣ ≤ 2 n k 2 1 k ≥ 1 , n ≥ 0 so that n = 0 ∑ ∞ k = 1 ∑ ∞ ∣ ∣ ∣ ∣ k ( − 1 ) k + 1 2 n k + 1 1 ∣ ∣ ∣ ∣ < ∞ which means (Fubini/Tonelli) that the series is absolutely convergent (and hence that all this reordering and manipulation is valid) would be a good idea.
That is a pretty easy B6!
The given sum can be re-written as:
S = k = 1 ∑ ∞ n = 0 ∑ ∞ k ( − 1 ) k − 1 ∫ 0 1 x k 2 n d x .
By absolute convergence, we are free to permute the integral and the sums:
S = ∫ 0 1 d x k = 1 ∑ ∞ n = 0 ∑ ∞ k ( − 1 ) k − 1 x k 2 n = − ∫ 0 1 d x n = 0 ∑ ∞ lo g ( 1 + x 2 n ) .
Which evaluates to 1 .
Problem Loading...
Note Loading...
Set Loading...
The sum is n = 0 ∑ ∞ k = 1 ∑ ∞ 2 n k + 1 1 k ( − 1 ) k − 1 . Consider how many times a number N appears as 2 n k . If N = 2 b a with a odd, then N + 1 1 will appear in b + 1 terms of the sum, when k = a , 2 a , 4 a , … , 2 b a and n = b , b − 1 , b − 2 , … , 0 . That is, our sum equals N = 1 ∑ ∞ N + 1 1 2 n k = N ∑ k ( − 1 ) k − 1 = N = 1 ∑ ∞ N + 1 1 ( a 1 − 2 a 1 − 4 a 1 − ⋯ − 2 b a 1 ) = N = 1 ∑ ∞ N + 1 1 2 b a 1 = N = 1 ∑ ∞ N ( N + 1 ) 1 = 1 (the sum telescopes ).