Binomial Expansion: Find (n+1)Ck in Terms of nCj

  • Thread starter Thread starter saadsarfraz
  • Start date Start date
  • Tags Tags
    Binomial Expansion
saadsarfraz
Messages
86
Reaction score
1
Hi, I've been struggling with this problem for sometime. Let nCk be the kth coefficient in the binomial expansion of (a+b)^n. Find an expression for (n+1)Ck in term of the various nCj. Feel free to treat k=0 and k=n+1 as special cases.
 
Physics news on Phys.org
(n+1)Ck = (n+1)!/[(n+1-k)!*k!]

vs.

nCk = n!/[(n-k)!k!]

Now (n+1)! = n!*(n+1) and (n+1-k)! = (n+1-k)(n-k)!
 
thanks for the reply but i don't think that's the answer. The question I posted is the 1st part. The second part states: Using the expression you found, (which is the question i posted) show that for all n>=0 and for all k, 0=<k<=n, nCk = n!/(k!)(n-k)!
 
saadsarfraz said:
Hi, I've been struggling with this problem for sometime. Let nCk be the kth coefficient in the binomial expansion of (a+b)^n. Find an expression for (n+1)Ck in term of the various nCj. Feel free to treat k=0 and k=n+1 as special cases.

Pascal's triangle: (n+1)Ck= nC(j-1)+ nCj for k not 0.
 
Namaste & G'day Postulate: A strongly-knit team wins on average over a less knit one Fundamentals: - Two teams face off with 4 players each - A polo team consists of players that each have assigned to them a measure of their ability (called a "Handicap" - 10 is highest, -2 lowest) I attempted to measure close-knitness of a team in terms of standard deviation (SD) of handicaps of the players. Failure: It turns out that, more often than, a team with a higher SD wins. In my language, that...
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Back
Top