Proving the Binomial Theorem: Simplifying 3^k C(n,k) = 2^2n

Join the discussion
Registration is free. Start your own thread to ask a follow-up.
1 reply · 3K views
jenny Downer
Messages
4
Reaction score
0
Use the Binomial Theorem to show that n summation k-0 3^k C(n,k) = 2^2n

hint of the question is 3^k C(n,k) = 3^k 1^n-k C(n,k)
 
Physics news on Phys.org
Think of applying the binomial theorem to the expansion of (1+3)^n.