Pascal’s Triangle is an amazing tool, especially when you need to calculate expressions of the form . There are two ways to represent Pascal’s Triangle: Through binomial coefficients or through finding the next row by adding together the neighbors of the row above.
Theory
Pascal’s Triangle is built up of the binomial coefficients , where is the row and is the place in the row.
You need to remember that Pascal’s Triangle starts with both a row and place number of 0. When you insert the numbers for and into the binomial coefficients, Pascal’s Triangle is formed. It looks like this:
Using this method makes it easy to find the exact coefficient you need.
Note! In general, you have that
Be sure to implicitly understand that this is correct!
Example 1
Find the numbers in row number 3 in Pascal’s Triangle
Looking at row number 3 means that and is 0, 1, 2 and 3. That makes the numbers in row number 3 as follows:
If you calculate the values of the binomial coefficients, you get this triangle:
Note! Every row of Pascal’s Triangle starts and ends with 1.
But if you can’t find or use the binomial coefficients, what should you do? There is a very simple method you can use if you already know what’s in the row above the one you’re trying to determine. It goes like this:
Theory
Add together two numbers that are next to each other in the row. Take the result and place it one row down, in-between the two numbers you just added.
Example 2
Write down the first four rows of Pascal’s Triangle by adding together row entries
The first row
has one entry and is known as row number 0. The entry is 1.
The second row
has two entries and is called row number 1. Both entries are 1, because all rows in Pascal’s Triangle start and end with 1.
The third row
has three entries and is known as row number 2. Now it pays off to have written down the first two rows, because you’re going to find the third row through Method 2. You know the first and last entries have to be 1, so the only entry you need to fill is the one in the middle.
Here you can see that the middle entry of the third row is .
The fourth row
has four entries and is called row number 3. The first and last entry has to be 1, so the entries you need to find are the two in the middle of the row. This is what comes out:
Here you can see that and that , which is how you get the two middle entries on the fourth row (row number 3).
You can always add a row to Pascal’s Triangle by using one of the methods outlined above. But if you need to know a row far down the triangle it is easiest to use the binomial coefficient , where is the row and is the place in the row. Of course you can use Method 2 as well, but if you want row number 30 it’ll take a very long time to figure it out.
Among other things, Pascal’s Triangle is used to find the number of combinations and calculations of the form (known as Newton’s binomial theorem).
Example 3
The figure below shows a part of Pascal’s Triangle.
From what you can see in the figure, find the values of and .
Example 4
Here you’ll see how to use the binomial theorem to calculate expressions of the form for :
Example 5
Calculate
You could find this by multiplying out all the parentheses, but why bother when you could just use Pascal’s Triangle like we showed in Example 4. The first thing to check is the exponent, which is 4. That tells you that row number 4 in Pascal’s Triangle has the coefficients you need (remember that the first row is row number 0). This gives these coefficients:
Finding the binomial coefficients gives you:
Next, you write out the multiplications of the two terms in . The method is as follows:
The parentheses consist of two terms, and . These are being raised to a power by an exponent.
The exponent of the first term, , needs to start with the exponent of the parentheses, which in this case is 4, and decrease to 0 term by term.
The exponent of the second term, 1, needs to start at 0 and increase to the exponent of the parenthesis, 4, term by term.
That looks like this:
Now you can put the five coefficients in front of each of the five terms. That gives you this: