Overview
Pascal’s triangle arranges binomial coefficients: each number is the sum of the two above it. Row n gives the coefficients of (a + b)ⁿ.
Enter a row number, starting from 0.
Worked examples
| Inputs | Result |
|---|---|
| Row number n6 | Row 6: 1, 6, 15, 20, 15, 6, 1Sum of the row: 64Largest entry: 20 |
Show 2 more examples
| Row number n3 | Row 3: 1, 3, 3, 1Sum of the row: 8Largest entry: 3 |
| Row number n10 | Row 10: 1, 10, 45, 120, 210, 252, 210, 120, 45, 10, 1Sum of the row: 1,024Largest entry: 252 |
How it works
Entry k of row n is C(n, k). The entries of row n add up to 2ⁿ.
The formula
C(n, k) = n! ÷ (k!(n − k)!)
| n, k | Row and position, counting from 0 |
Practical tips
- Row 6 is 1, 6, 15, 20, 15, 6, 1, which adds up to 64.
- (a + b)² = a² + 2ab + b² uses row 2.
- Row entries give coin-flip counts.
Frequently asked questions
Why does it start at row 0?
Because (a + b)⁰ = 1.
How is it related to probability?
Row n counts the ways to get each number of heads in n flips.