Proof of Binomial Identity: Proving SUM(nCk)*2^k=(3^n+(-1)^n)/2

  • Thread starter Thread starter proptrader
  • Start date Start date
  • Tags Tags
    Binomial Identity
proptrader
Messages
10
Reaction score
0

Homework Statement


Prove that for all positive integers n, the equality holds:
SUM(nCk)*2^k=(3^n+(-1)^n)/2
Note: The sum goes from k=0 to n. AND k has to be even.


Homework Equations


Binomial Theorem


The Attempt at a Solution


I know that if we use the binomial theorem for x=2 and y=1, we would get
(2+1)^n=SUM(nCk)*2^k , with no restriction for k being even. I wonder how to proceed.
Thanks.
 
Physics news on Phys.org
Hint: Your idea looks like a good start. You have done (writing it in the other order) the expansion of (1 + 2)n.

Look at the same thing for (1 - 2)n and see if that gives you any ideas.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top