Pascal's Triangle Calculator
Test cases replayed : 3 of 3 match · Methodology · No outside source listed
Rows and positions are counted from 0: the top 1 is row 0, position 0.
Result
Entry C(n, k) = n! ÷ (k!(n − k)!)
Sum of row n (2ⁿ)
- Largest entry of the row, C(n, ⌊n/2⌋)
- Entries in the row
Estimate for planning only, not tax, legal, financial or medical advice. This calculator uses the method explained on this page.
This browser did not allow copying. The sentence is in the box below, already selected: copy it with your keyboard or the menu.
How to use this calculator
Fill in the fields in this order; each step takes you to its field.
- Row n (0 to 50): enter a number from 0 to 50.
- Position k in the row (0 to n): enter 0 or more.
- Read the result: Entry C(n, k) = n! ÷ (k!(n − k)!); the panel also shows Sum of row n (2ⁿ), Largest entry of the row, C(n, ⌊n/2⌋) and Entries in the row.
How this calculator works
Each entry of Pascal's triangle is the sum of the two above it, and the entry in row n, position k is the binomial coefficient C(n, k) = n! ÷ (k!(n − k)!), the coefficient of xᵏ in (1 + x)ⁿ.
Row n has n + 1 entries that add up to 2ⁿ, and it is symmetric: C(n, k) = C(n, n − k). Its largest entry is in the middle, C(n, ⌊n/2⌋).
The formula
| Symbol | Meaning |
|---|---|
| Row n (0 to 50) | |
| Position k in the row (0 to n) | |
| Entry C(n, k) = n! ÷ (k!(n − k)!) | |
ncr(n, k) | the number of ways to choose k items from n, order ignored. |
Worked example
| Row n (0 to 50) | 5 |
|---|---|
| Position k in the row (0 to n) | 2 |
| Sum of row n (2ⁿ) | 32 |
|---|---|
| Largest entry of the row, C(n, ⌊n/2⌋) | 10 |
| Entries in the row | 6 |
Entry C(n, k) = n! ÷ (k!(n − k)!) 10
Each step uses the unrounded value of the step before it; figures on this page are rounded for display.
Frequently asked questions
What is row 5 of Pascal's triangle?
1, 5, 10, 10, 5, 1. The entry at position 2 is C(5, 2) = 10 and the row adds up to 32.
What is the middle of row 20?
C(20, 10) = 184,756, out of a row total of 1,048,576.