Pascal's Triangle
The figure below, extended infinitely.
A particular entry is found by adding the two numbers that are
above and on either side of the element. Note: The numbers which
make up Pascal's triangle are called binomial
coefficients.
Pascal's Triangle
Note that the sum of
any two adjacent elements
in a row can be found
between them on the next row. Each row begins and ends with
1. |
|

etc.
|
See also
Binomial coefficients
in Pascal's triangle, binomial theorem
Worked Example
Problem: Build the first 6 rows of Pascal's Triangle (rows 0 through 5), then find the entry in row 5, position 2.
Step 1: Row 0 has a single entry: just 1.
Row 0: 1 Step 2: Row 1 also starts and ends with 1.
Row 1: 11 Step 3: For row 2, the edges are 1 and the middle entry is 1 + 1 = 2.
Row 2: 121 Step 4: Continue the pattern. Each interior entry is the sum of the two entries above it.
Row 3: 1331 Step 5: Build rows 4 and 5 the same way.
Row 4: 14641Row 5: 15101051 Step 6: The entry at row 5, position 2 (counting from 0) is 10. Verify with the formula:
(25)=2!3!5!=2⋅6120=10 Answer: The entry in row 5, position 2 of Pascal's Triangle is 10.
Another Example
Problem: Use Pascal's Triangle to expand (a+b)4. Step 1: Row 4 of Pascal's Triangle gives the coefficients: 1, 4, 6, 4, 1.
Row 4: 14641 Step 2: Each coefficient multiplies a term where the powers of a decrease and the powers of b increase.
(a+b)4=1a4+4a3b+6a2b2+4ab3+1b4 Answer: (a+b)4=a4+4a3b+6a2b2+4ab3+b4 Frequently Asked Questions
What are the patterns hidden in Pascal's Triangle?
There are many. The first diagonal is all 1s, the second diagonal lists the counting numbers (1, 2, 3, …), and the third diagonal lists the triangular numbers (1, 3, 6, 10, …). The sum of each row equals a power of 2: row n sums to 2n. If you shade only the odd entries, you get a fractal pattern resembling the Sierpiński triangle. How do you find a specific number in Pascal's Triangle without building the whole thing?
Use the binomial coefficient formula directly: the entry in row n, position k is (kn)=k!(n−k)!n!. For example, row 10, position 3 is (310)=3!7!10!=120. Why It Matters
Pascal's Triangle provides the coefficients needed to expand any binomial expression (a+b)n, making it essential for the Binomial Theorem. It also encodes the number of ways to choose k items from n items, so it is central to combinatorics and probability. Many surprising number patterns—Fibonacci numbers, powers of 2, triangular numbers—all emerge from this single structure. Common Mistakes
Mistake: Starting the row and position numbering at 1 instead of 0.
Correction: Pascal's Triangle is conventionally numbered starting from row 0 and position 0. Row 0 contains the single entry 1. If you start at 1, your binomial coefficient formula (kn) will point to the wrong entry. Mistake: Forgetting that every row starts and ends with 1.
Correction: The outermost entries are always 1 because (0n)=1 and (nn)=1. Only the interior entries are found by adding two numbers from the row above.