| Index n | Row of coefficients |
|---|---|
| 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 |
| 7 | 1 7 21 35 35 21 7 1 |
Making the next row
- Start with 1 Every row begins with 1.
- Add neighbouring pairs Each new entry is the sum of the two above it.
- End with 1 Every row ends with 1.
- Check the count Row n has n + 1 numbers, and they add up to 2ⁿ.
In (a + b)ⁿ there are n + 1 terms; the power of a falls from n to 0 while the power of b rises from 0 to n; in every term the powers add up to n.
Key takeaways: (a + b)ⁿ has n + 1 terms, the powers of a fall and the powers of b rise, and the powers in each term add up to n. In Pascal's triangle every entry is the sum of the two above it, each row is symmetric, and row n adds up to 2ⁿ. Substitute whole terms, with their signs and coefficients, into the pattern.