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 rr of row nn is (nr)\binom{n}{r}, 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.

Interactive

Pascal's triangle

The highlighted entry is row 5, entry 2, counting both from 0. It is 1010, and so is (52)\binom{5}{2}.

The first seven rows. The top row is row 0.
Row nnEntries
01
11 1
21 2 1
31 3 3 1
41 4 6 4 1
51 5 10 10 5 1
61 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 rr of row nn is (nr)\binom{n}{r}.

Row 4 is 1,4,6,4,11, 4, 6, 4, 1, which is (40),(41),(42),(43),(44)\binom{4}{0}, \binom{4}{1}, \binom{4}{2}, \binom{4}{3}, \binom{4}{4}.

Row 6 of Pascal's triangle is 1,6,15,20,15,6,11, 6, 15, 20, 15, 6, 1. What is (64)\binom{6}{4}?

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: (41)=4\binom{4}{1} = 4 ways. Or she is not, and you pick both from the other 4: (42)=6\binom{4}{2} = 6 ways. So (52)=4+6=10\binom{5}{2} = 4 + 6 = 10, which is exactly the sum of the two entries above it in row 4.

Pascal's rule
(nr)=(n−1r−1)+(n−1r)\binom{n}{r} = \binom{n - 1}{r - 1} + \binom{n - 1}{r}
Why Pascal's rule works for every n and r

Pick any one of the nn objects and call it A. Every selection of rr objects either includes A or leaves it out.

  • Selections that include A: choose the other r−1r - 1 objects from the remaining n−1n - 1, in (n−1r−1)\binom{n - 1}{r - 1} ways.
  • Selections that leave A out: choose all rr objects from the remaining n−1n - 1, in (n−1r)\binom{n - 1}{r} ways.

No selection is in both groups, and every selection is in one of them, so (nr)=(n−1r−1)+(n−1r)\binom{n}{r} = \binom{n - 1}{r - 1} + \binom{n - 1}{r}. In the triangle, (n−1r−1)\binom{n - 1}{r - 1} and (n−1r)\binom{n - 1}{r} are the two entries just above (nr)\binom{n}{r}.

Worked example

Build row 7 of Pascal's triangle from row 6

  • Simple familiar
  • Technology free

Row 6 of Pascal's triangle is 1,6,15,20,15,6,11, 6, 15, 20, 15, 6, 1.

(a) Write down row 7.

(b) Hence find (73)\binom{7}{3} and (75)\binom{7}{5}.

4 steps

Try it yourself first, then check the working one step at a time.

Method

  1. Begin and end the new row with 1.

  2. Add each neighbouring pair in the row above.

  3. Check that the row is symmetric and adds to 2n2^n.

  4. Read (nr)\binom{n}{r} as entry rr, counting from 0.

Watch out for

  • Counting entries from 1, which gives (73)=21\binom{7}{3} = 21.

Given that (94)=126\binom{9}{4} = 126 and (95)=126\binom{9}{5} = 126, find (105)\binom{10}{5}.

Key idea

Patterns worth knowing

  • Symmetry. Each row reads the same in both directions, because (nr)=(nn−r)\binom{n}{r} = \binom{n}{n - r}.
  • Counting numbers. Entry 1 of row nn is nn, because (n1)=n\binom{n}{1} = n.
  • Row totals. Row nn adds to 2n2^n. Each of the nn objects is either in a selection or out of it, so there are 2n2^n selections of all sizes together.
Interactive

Patterns in the triangle

Look for the symmetry, the counting numbers 1,2,3,…1, 2, 3, \ldots and the row totals 1,2,4,8,16,…1, 2, 4, 8, 16, \ldots

Which of these is equal to (129)\binom{12}{9}?

Choose one answer

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 1,6,15,20,15,6,11, 6, 15, 20, 15, 6, 1, so (62)=15\binom{6}{2} = 15, not 6. A quick check: (n1)\binom{n}{1} should always be nn.

Exam tip

Paper 1 has no nCr key

The formula book gives the binomial theorem but not a way to calculate (nr)\binom{n}{r}. 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 2n2^n.

Summary

  • Each row of Pascal's triangle starts and ends with 1; every other entry is the sum of the two above it.

  • Entry rr of row nn, counting both from 0, is (nr)\binom{n}{r}.

  • Pascal's rule: (nr)=(n−1r−1)+(n−1r)\binom{n}{r} = \binom{n - 1}{r - 1} + \binom{n - 1}{r}, because a selection either includes a particular object or does not.

  • Rows are symmetric, (nr)=(nn−r)\binom{n}{r} = \binom{n}{n - r}, and row nn adds to 2n2^n.

Finished the lesson?

Try the 3 quick checks above and the lesson completes itself, or mark it complete now.

Lesson 2 of 80% read

Save your progress with a free account