2 2 1 + 2 3 2 + 2 4 3 + 2 5 4 + ⋯ 3 2 1 + 3 3 2 + 3 4 3 + 3 5 4 + ⋯ 4 2 1 + 4 3 2 + 4 4 3 + 4 5 4 + ⋯ = 1 2 1 = 1 1 = 2 2 1 = 4 1 = 3 2 1 = 9 1 ⋮
Basing on the infinite sums above, is it true that for all k ≥ 2 k 2 1 + k 3 2 + k 4 3 + k 5 4 + ⋯ = ( k − 1 ) 2 1 ?
Bonus: Find the closed form, if it exists, of the following infinite sum for all n ≥ 2 . k n + 1 n + k n + 2 n + 1 + k n + 4 n + 3 + k n + 6 n + 4 + ⋯
The problem is original.
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.
@Naren Bhandari , why you have to write n = 2 and then k n n − 1 + k n + 1 n + k n + 2 n + 1 + ⋯ . Can't we just write k 2 1 + k 3 2 + k 4 3 + ⋯ ?
Log in to reply
Well, Sir, maybe because, he wanted the closed form............
Log in to reply
No, just replace n with 2, you will get the same expression.
Log in to reply
@Chew-Seong Cheong – No no........I meant, closed form in terms of "n".......
Log in to reply
@Aaghaz Mahajan – I can't remember what was the original form of the problem. The one above has been edited.
Yes, we can sir however, to make clear about the bonus problem I need to write. If you think it's good write as you mentioned, please edit for me.
Thank you !!
@Naren Bhandari , I have edited your problem and proved the bonus part.
Problem Loading...
Note Loading...
Set Loading...
Consider the following Maclaurin series for − 1 < x < 1 :
1 − x 1 ( 1 − x ) 2 1 ( 1 − x ) 2 x 2 = 1 + x + x 2 + x 3 + ⋯ = 1 + 2 x + 3 x 2 + 4 x 3 + ⋯ = x 2 + 2 x 3 + 3 x 4 + 4 x 5 + ⋯ Differentiate both sides w.r.t. x Multiply both sides by x 2
Putting x = k 1 , we have:
k 2 1 + k 3 2 + k 4 3 + ⋯ = ( 1 − k 1 k 1 ) 2 = ( k − 1 ) 2 1 .
Bonus :
S n = j = n ∑ ∞ k j + 1 j = j = 1 ∑ ∞ k j + 1 j − j = 1 ∑ n − 1 k j + 1 j = ( k − 1 ) 2 1 − x 2 d x d ( x − 1 x n − 1 ) = ( k − 1 ) 2 1 − x 2 ( ( x − 1 ) 2 ( n − 1 ) x n − n x n − 1 + 1 ) = ( k − 1 ) 2 1 − k n ( k − 1 ) 2 k n − n ( k − 1 ) − 1 = ( k − 1 ) 2 1 − ( k − 1 ) 2 1 + k n ( k − 1 ) 2 n ( k − 1 ) + 1 = k n ( k − 1 ) 2 n ( k − 1 ) + 1 where x = k 1
Note that when n = 1 , S 1 = ( k − 1 ) 2 1 as expected.