CheddarCheese
New member
- Joined
- Oct 2, 2011
- Messages
- 4
Hello all, first off, I hope I'm posting this question in the right place. If not, I'm sorry, and I'll try not to make the same mistake later.
Well, I've been working on Michael Spivak's Calculus Chapter 2, and am stuck on a question. It asks:
Prove the "binomial theorem": If a and b are any numbers and n is a natural number, then:
(a + b)n = an + (nC1)an-1b + (nC2)an-2b2 + ... + (nC(n-1))abn-1 + bn = Σ nj=0(nCj)an-jbj
I have not yet been taught how to do something like this, yet I am required to complete this for an assignment. I really have no idea where to begin. Any beginning steps and pointers would be very much appreciated.
Thanks!
Well, I've been working on Michael Spivak's Calculus Chapter 2, and am stuck on a question. It asks:
Prove the "binomial theorem": If a and b are any numbers and n is a natural number, then:
(a + b)n = an + (nC1)an-1b + (nC2)an-2b2 + ... + (nC(n-1))abn-1 + bn = Σ nj=0(nCj)an-jbj
I have not yet been taught how to do something like this, yet I am required to complete this for an assignment. I really have no idea where to begin. Any beginning steps and pointers would be very much appreciated.
Thanks!
Last edited: