You are Here: Home >< Maths

# Binomial Theorem Proof. watch

1. Can someone explain the proof of this binomial theorem:

to me simply because I find the logic a little hard to follow along although I grasp it a small amount but would like to fully come to understand this.

I am looking for the combinations proof not the induction.

Thanks!
2. First of all .

Now what you want to do to get the general formula for the binomial theorem (when ), is to collect all the individual together.

For the , we see that we want n of the s out of n, so we have choices, which is equal to . But we have no s in our expression, as all of our choices have been filled with s.

For the , we see that we need to choose n-1 s out of n ones. Now clearly this is . But if you choose n - 1 s, you always have 1 with your , so we have that .

Same logic for . We need to choose n - 2 s out of n, so we have choices. But if you wants the parts of the expression with only , then you're going to get with it, as the remaining 2 choices must be given to . So we have that .

And so on....

Continuing in this way, we get that
.
3. This set of videos explains it somewhat I believe...
I suggest watching this in conjunction (not at the same time though obvsly.. lol) with reading this...
http://www.mathsisfun.com/combinator...mutations.html
4. (Original post by 0x2a)
First of all .

Now what you want to do to get the general formula for the binomial theorem (when ), is to collect all the individual together.

For the , we see that we want n of the s out of n, so we have choices, which is equal to . But we have no s in our expression, as all of our choices have been filled with s.

For the , we see that we need to choose n-1 s out of n ones. Now clearly this is . But if you choose n - 1 s, you always have 1 with your , so we have that .

Same logic for . We need to choose n - 2 s out of n, so we have choices. But if you wants the parts of the expression with only , then you're going to get with it, as the remaining 2 choices must be given to . So we have that .

And so on....

Continuing in this way, we get that
.
+5 for patience alone ...
5. (Original post by TeeEm)
+5 for patience alone ...
Thank you, but that was nothing after a whole chapter on determinants
6. (Original post by 0x2a)
Thank you, but that was nothing after a whole chapter on determinants
7. Sorry to intrude but I was also wondering on how would you prove the binomial theorem when n is not an integer but rational. If anyone has a proof of this would they mind sharing?
8. (Original post by EmptyMathsBox)
Sorry to intrude but I was also wondering on how would you prove the binomial theorem when n is not an integer but rational. If anyone has a proof of this would they mind sharing?
https://www.proofwiki.org/wiki/Binom...nomial_Theorem
9. (Original post by EmptyMathsBox)
Sorry to intrude but I was also wondering on how would you prove the binomial theorem when n is not an integer but rational. If anyone has a proof of this would they mind sharing?
When n is not an integer you need to use some fairly heavy machinery from Analysis to prove the result. It's not terribly difficult, but the proof relies on setting up various results about power series, convergence and differentiability, so you're basically asking someone to copy out a chunk of textbook work.

I would see if you can track down a decent Analysis textbook, or try googling for "proof of binomial theorem" to see if there are links to any decent website proofs

### Related university courses

TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Updated: December 30, 2014
Today on TSR

### Summer Bucket List is Back!

Start yours and you could win £150!

Poll
Useful resources

### Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

### How to use LaTex

Writing equations the easy way

### Study habits of A* students

Top tips from students who have already aced their exams