How to find the sum of series sum_(k=1)^n 2^kC(n,k)

HypeMyday3m

HypeMyday3m

Answered question

2022-09-22

How to find the sum of series k = 1 n 2 k C ( n , k )

Answer & Explanation

xjiaminhoxy4

xjiaminhoxy4

Beginner2022-09-23Added 9 answers

Suppose you are interested, for some function f ( k ), in the binomial sum
B ( n ) = k = 0 n ( n k ) f ( k ) .
Then, taking Δ f ( k ) = f ( k + 1 ) f ( k ), denote A ( n ) by
A ( n ) = k = 0 n ( n k ) Δ f ( k ) .
It's fairly easy to prove that B ( n + 1 ) 2 B ( n ) = A ( n ) with initial condition B ( 0 ) = f ( 0 ).
f ( k ) = 2 k , and, of course, Δ f ( k ) = 2 k as well. So A ( n ) = B ( n ), and thus the sum B ( n ) = k = 0 n ( n k ) 2 k can be found by solving the simple recurrence B ( n + 1 ) = 3 B ( n ) with initial condition B ( 0 ) = 1.
mundocromadomg

mundocromadomg

Beginner2022-09-24Added 3 answers

Substitute x = 2 into the binomial expansion of ( 1 + x ) n and then rearrange.

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?