Hi, would some one please explain to me the equation in the beginning of this video and what it is solving and provide an example, and just explain what the pascal triangle is and what it accomplishes, because i don't get it >.<
Pascal's Triangle and the Binomial Coefficients - YouTube
please and thank you. I need this because part of my math summative is going to be on this and I'm supposed to learn this by myself!
Although it is possible to use Pascal's triangle to find the coefficients in the expansion of where , this becomes impractical for large values of because of the need to write out all of the preceding rows. For this reason, let's look at another pattern in the expansion of .
The first and last terms are and respectively. In this expansion, the coefficient of any term after the first can be generated as follows:
In the previous term, which we'll enumerate as the th term, multiply the coefficient by the exponent of and then divide by . I'll demonstrate this technique for the expansion of .
The first term could be written as:
For the next term, we subtract 1 from the exponent of , add 1 to the exponent of and find that the coefficient is and so the next term is .
And so the third term is , and then the fourth term is .
Now, by symmetry, where observation of the exponents tells you when you have reached the mid-point, that is, when the exponent on is less than or equal to the exponent on , we then know the coefficients will on the right be the "mirror image" of those on the left, and we may now state:
As you can see, this method is more efficient than using Pascal's triangle, because as stated, there is no need to generate the coefficients for every line previous to the one you want. You do have to generate the first half of a line and then use symmetry to fill in the other half.
Now, as Plato pointed out, the most efficient way of finding these binomial coefficients uses factorial notation. The number (read "n factorial) is defined as follows:
For any natural number :
It can be proven by induction that the coefficient of the th term ( = 0 to ) in the expansion of is:
where .
This number, called a binomial coefficient, is also referred to as above or choose , since it can be shown that this is the number of way to choose elements from a set of elements.
In this expansion, we will find:
i) There are terms.
ii) The first term is , and the last term is .
iii) The exponents of decreases by 1, while the exponent on increases by 1 in each succeeding term.
iv) The sum of the exponents on and is in every term.
v) The coefficient of and is .
vi) The th term is .
These observations about the expansion of suggest the binomial theorem:
Here is another way of looking at the binomial theorem. Consider the following expansion:
You obtain each product shown in the expansion by multiplying 3 variables, one from each of the binomial factors . The term for example is the result of choosing from the first binomial factor, from the second and from the third. Do you see that the products , and are those that result when you select from one binomial factor and from the other two?
Can you see how this implies ? This of each variable as a binary digit and notice we are simply counting from 0 to .
So, by the commutative property of multiplication, we may combine like terms to get:
and so we may observe that 3 is the number of ways to select either 1 or 1 from the three binomial factors.
We can think of each binomial factor as the flip of a coin, where there are two possible outcomes. The binomial coefficient just shows how many different ways there are to obtain of one outcome and of the other.