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

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.
 
I picked up this problem from the Schaum's series book titled "College Mathematics" by Ayres/Schmidt. It is a solved problem in the book. But what surprised me was that the solution to this problem was given in one line without any explanation. I could, therefore, not understand how the given one-line solution was reached. The one-line solution in the book says: The equation is ##x \cos{\omega} +y \sin{\omega} - 5 = 0##, ##\omega## being the parameter. From my side, the only thing I could...
Back
Top