Pascal's triangle in simple words
Pascal's triangle is a triangle of numbers. It starts with a 1 at the top. Every row starts and ends with 1, and every other number is the two numbers just above it added together.
Example: row 3 is 1, 3, 3, 1. To get row 4, add each pair next to each other: 1 + 3 = 4, 3 + 3 = 6, 3 + 1 = 4. Put a 1 at each end and row 4 is 1, 4, 6, 4, 1.
The top row is called row 0, and the first number in each row is position 0. So in row 4, position 2 is the number 6. This is written C(4, 2).
The triangle helps with counting. If you flip a coin 4 times, row 4 tells you there are 6 ways to get exactly 2 heads.
How the triangle is built
Rows and positions are numbered from 0. Each row starts and ends with 1, and every inner entry is the sum of the two entries above it: C(n, k) = C(n − 1, k − 1) + C(n − 1, k).
The entry in row n, position k is the binomial coefficient C(n, k) = n! ÷ (k! × (n − k)!). It is the number of ways to choose k items from n, and the coefficient of xᵏyⁿ⁻ᵏ in (x + y)ⁿ.
Worked example
Row 5 is 1, 5, 10, 10, 5, 1, so (x + y)⁵ = x⁵ + 5x⁴y + 10x³y² + 10x²y³ + 5xy⁴ + y⁵. Its entries add to 2⁵ = 32.
C(52, 5) = 2,598,960 is the number of different five-card hands from a 52-card deck.
Useful patterns
Each row reads the same forwards and backwards, because C(n, k) = C(n, n − k). Row n adds up to 2ⁿ. The second diagonal holds the counting numbers, the third holds the triangular numbers, and adding along the shallow diagonals gives the Fibonacci numbers.