Lesson 2 of 8 · 13 min
Pascal's triangle and binomial coefficients
Build Pascal's triangle, see why its entries are the binomial coefficients nCr, and use its patterns to find coefficients quickly.
What you will be able to do
- Build any row of Pascal's triangle from the row above it.
- Recognise that entry of row is , counting rows and entries from 0.
- Use Pascal's rule and the symmetry of the triangle to find binomial coefficients.
Start with a 1. Write each new row underneath, beginning and ending with 1, and make every other number the sum of the two numbers just above it. The result is Pascal's triangle.
It looks like a curiosity, but every number in it counts something you met in the last lesson.
The highlighted entry is row 5, entry 2, counting both from 0. It is , and so is .
| Row | Entries |
|---|---|
| 0 | 1 |
| 1 | 1 1 |
| 2 | 1 2 1 |
| 3 | 1 3 3 1 |
| 4 | 1 4 6 4 1 |
| 5 | 1 5 10 10 5 1 |
| 6 | 1 6 15 20 15 6 1 |
Key idea
The triangle holds the binomial coefficients
Number the rows from 0 at the top, and the entries in each row from 0 at the left. Then entry of row is .
Row 4 is , which is .
Row 6 of Pascal's triangle is . What is ?
History
Older than Pascal
The triangle is named after the French mathematician Blaise Pascal, who wrote about it in the 1650s. It is much older than that. In China it is called Yang Hui's triangle and in Iran the Khayyam triangle, honouring mathematicians who lived centuries before Pascal.
Why does adding the two numbers above give the next one? Think about choosing 2 students from 5, one of whom is Ava.
Either Ava is chosen, and you pick 1 more from the other 4: ways. Or she is not, and you pick both from the other 4: ways. So , which is exactly the sum of the two entries above it in row 4.
Why Pascal's rule works for every n and r
Pick any one of the objects and call it A. Every selection of objects either includes A or leaves it out.
- Selections that include A: choose the other objects from the remaining , in ways.
- Selections that leave A out: choose all objects from the remaining , in ways.
No selection is in both groups, and every selection is in one of them, so . In the triangle, and are the two entries just above .
Worked example
Build row 7 of Pascal's triangle from row 6
Row 6 of Pascal's triangle is .
(a) Write down row 7.
(b) Hence find and .
Step 1: Start and end with 1
Every row begins and ends with 1. Row 7 has 8 entries, so there are 6 more to find in between.
Step 2: Add neighbouring pairs from row 6
, , , , and .
Each entry is the sum of the two entries above it (Pascal's rule).
Step 3: Write the row and check it
Row 7 is . It is symmetric, and it adds to .
Step 4: Read off the coefficients, counting from 0
Entry 3 is , so . Entry 5 is , so .
The first 1 is entry 0, which is .
Try it yourself first, then check the working one step at a time.
Answer
(a) Row 7 is . (b) and .
Method
Begin and end the new row with 1.
Add each neighbouring pair in the row above.
Check that the row is symmetric and adds to .
Read as entry , counting from 0.
Watch out for
Counting entries from 1, which gives .
Given that and , find .
Key idea
Patterns worth knowing
- Symmetry. Each row reads the same in both directions, because .
- Counting numbers. Entry 1 of row is , because .
- Row totals. Row adds to . Each of the objects is either in a selection or out of it, so there are selections of all sizes together.
Look for the symmetry, the counting numbers and the row totals
Which of these is equal to ?
Common mistake
Counting from 1 instead of 0
The top row is row 0, and the first entry of every row is entry 0. Row 6 is , so , not 6. A quick check: should always be .
Exam tip
Paper 1 has no nCr key
The formula book gives the binomial theorem but not a way to calculate . In the technology-free paper, write out the rows of Pascal's triangle you need in the margin. It takes under a minute to reach row 7, and each row checks itself: it must be symmetric and add to .
Summary
Each row of Pascal's triangle starts and ends with 1; every other entry is the sum of the two above it.
Entry of row , counting both from 0, is .
Pascal's rule: , because a selection either includes a particular object or does not.
Rows are symmetric, , and row adds to .
Finished the lesson?
Try the 3 quick checks above and the lesson completes itself, or mark it complete now.