Pascal's Triangle - Definition, Patterns, Examples

#Algebra
TL;DR
Pascal's Triangle is a triangular array where every number is the sum of the two directly above it, and each row holds the coefficients of a binomial expansion. This article shows how to build the triangle, the patterns hiding inside it, the link to (nr)\binom{n}{r}, and the mistakes students make first.
BT
Bhanzu TeamLast updated on July 13, 202610 min read

A Shape That Predicts Every Coin Toss Before You Flip

One triangle of numbers already knows the odds of every coin toss you will ever make. The row that starts 1,5,10,10,5,11, 5, 10, 10, 5, 1 tells you there are ten ways out of thirty-two to get three heads in five flips. That is Pascal's Triangle doing its quiet work.

What Is Pascal's Triangle?

Pascal's Triangle is a triangular arrangement of numbers in which the number at the top is 11, every number on the slanted edges is 11, and every interior number equals the sum of the two numbers diagonally above it. The rows are numbered from n=0n = 0 at the top, and the entries across row nn are exactly the coefficients you get when you expand (a+b)n(a + b)^n.

That second fact is why the triangle earns its place in algebra. Write out (a+b)2=a2+2ab+b2(a+b)^2 = a^2 + 2ab + b^2 and the coefficients are 1,2,11, 2, 1, row 22. Expand (a+b)3=a3+3a2b+3ab2+b3(a+b)^3 = a^3 + 3a^2b + 3ab^2 + b^3 and the coefficients are 1,3,3,11, 3, 3, 1, row 33. The triangle hands you the numbers without any multiplying out.

How Do You Build Pascal's Triangle?

Start with a single 11 at the apex. That is row 00. Each new row begins and ends with 11, and you fill the inside by adding neighbours from the row above.

Building row 44 from row 33 (1,3,3,11, 3, 3, 1):

11 1+3=41 + 3 = 4 3+3=63 + 3 = 6 3+1=43 + 1 = 4 11

So row 44 is 1,4,6,4,11, 4, 6, 4, 1. The rule is sometimes written as Pascal's rule:

(nr)=(n−1r−1)+(n−1r)\binom{n}{r} = \binom{n-1}{r-1} + \binom{n-1}{r}

Here (nr)\binom{n}{r} (read "nn choose rr") is the entry in row nn, position rr (counting positions from 00). It is the same as the binomial coefficient, computed directly by

(nr)=n!r!,(n−r)!\binom{n}{r} = \frac{n!}{r!,(n-r)!}

where n!n! ("nn factorial") means n×(n−1)×⋯×2×1n \times (n-1) \times \cdots \times 2 \times 1. You never need the formula to build the triangle — addition alone does it — but the formula lets you jump straight to a single entry without writing every row first.

The Patterns Hidden Inside Pascal's Triangle

The triangle is famous because so many number patterns live inside one simple rule. The patterns most worth knowing:

  • Row sums are powers of 2. Add every entry in row nn and you get 2n2^n. Row 33: 1+3+3+1=8=231 + 3 + 3 + 1 = 8 = 2^3.

  • The triangle is symmetric. Each row reads the same left-to-right as right-to-left, because (nr)=(nn−r)\binom{n}{r} = \binom{n}{n-r}.

  • The diagonals count things. The first diagonal is all 11s; the second is the counting numbers 1,2,3,4,…1, 2, 3, 4, \ldots; the third is the triangular numbers 1,3,6,10,…1, 3, 6, 10, \ldots

  • The shallow diagonals add to Fibonacci numbers. Sum the entries along a gentle diagonal slice and you get 1,1,2,3,5,8,…1, 1, 2, 3, 5, 8, \ldots, the Fibonacci sequence.

  • Binomial coefficients. Row nn is the coefficient list for (a+b)n(a+b)^n, the property that ties the triangle to the binomial theorem.

Not every pattern is on this list — there are more (the hockey-stick identity, the prime-row divisibility rule), and you will meet them later. These five carry most of the weight at this level.

Examples of Pascal's Triangle

Example 1

Write out the first five rows of Pascal's Triangle.

Start at row 00 and apply the add-the-two-above rule:

Row 0:1\text{Row } 0: \quad 1 Row 1:11\text{Row } 1: \quad 1 \quad 1 Row 2:121\text{Row } 2: \quad 1 \quad 2 \quad 1 Row 3:1331\text{Row } 3: \quad 1 \quad 3 \quad 3 \quad 1 Row 4:14641\text{Row } 4: \quad 1 \quad 4 \quad 6 \quad 4 \quad 1

Final answer: the rows are 11; 1,11,1; 1,2,11,2,1; 1,3,3,11,3,3,1; 1,4,6,4,11,4,6,4,1.

Example 2

Use Pascal's Triangle to expand (a+b)4(a + b)^4.

A natural first move is to grab the row you want by counting rows from 1. Say you reach for the fourth row written down, 1,3,3,11, 3, 3, 1, and write (a+b)4=a4+3a3b+3a2b2+b3(a+b)^4 = a^4 + 3a^3b + 3a^2b^2 + b^3. Check the powers: the exponents on aa and bb in each term should add to 44, but a3ba^3b gives 3+1=43 + 1 = 4 while the last term b3b^3 gives only 33. The expansion is short a term, and the coefficients are wrong.

The slip is counting the rows from 11 instead of from 00. The coefficients of (a+b)4(a+b)^4 come from row 44, which is the fifth row written down: 1,4,6,4,11, 4, 6, 4, 1.

(a+b)4=1a4+4a3b+6a2b2+4ab3+1b4(a+b)^4 = 1a^4 + 4a^3b + 6a^2b^2 + 4ab^3 + 1b^4

The power of aa falls from 44 to 00 while the power of bb climbs from 00 to 44, and every term's exponents sum to 44.

Final answer: (a+b)4=a4+4a3b+6a2b2+4ab3+b4(a+b)^4 = a^4 + 4a^3b + 6a^2b^2 + 4ab^3 + b^4.

Example 3

Find the entry in row 66, position 22 (counting positions from 00).

Using the formula:

(62)=6!2!,(6−2)!=6!2!,4!\binom{6}{2} = \frac{6!}{2!,(6-2)!} = \frac{6!}{2!,4!} =6×52×1=302=15= \frac{6 \times 5}{2 \times 1} = \frac{30}{2} = 15

Row 66 is 1,6,15,20,15,6,11, 6, 15, 20, 15, 6, 1, and position 22 is indeed 1515.

Final answer: (62)=15\binom{6}{2} = 15.

Example 4

Expand (x+2)3(x + 2)^3 using Pascal's Triangle.

Row 33 gives the coefficients 1,3,3,11, 3, 3, 1. Apply them with a=xa = x and b=2b = 2:

(x+2)3=1⋅x3+3⋅x2(2)+3⋅x(2)2+1⋅(2)3(x+2)^3 = 1\cdot x^3 + 3\cdot x^2(2) + 3\cdot x(2)^2 + 1\cdot(2)^3 =x3+6x2+12x+8= x^3 + 6x^2 + 12x + 8

Final answer: (x+2)3=x3+6x2+12x+8(x+2)^3 = x^3 + 6x^2 + 12x + 8.

Example 5

A fair coin is tossed five times. In how many ways can exactly two heads appear?

The number of ways to choose which 22 of the 55 tosses are heads is the entry in row 55, position 22:

(52)=5!2!,3!=5×42×1=10\binom{5}{2} = \frac{5!}{2!,3!} = \frac{5 \times 4}{2 \times 1} = 10

Row 55 reads 1,5,10,10,5,11, 5, 10, 10, 5, 1, and position 22 is 1010. So there are 1010 ways out of 25=322^5 = 32 total outcomes.

Final answer: 1010 ways.

Example 6

Confirm that the entries in row 44 sum to 242^4.

Row 44 is 1,4,6,4,11, 4, 6, 4, 1.

1+4+6+4+1=16=241 + 4 + 6 + 4 + 1 = 16 = 2^4

The row sum matches the power-of-two pattern.

Final answer: the row-44 sum is 16=2416 = 2^4.

Why the Triangle Keeps Reappearing

Pascal's Triangle survives because it answers a question humans keep asking: in how many ways can things combine? The Persian poet-mathematician Omar Khayyam and the Chinese mathematician Yang Hui both wrote down the array centuries before Blaise Pascal — it kept being rediscovered precisely because the counting problem it solves is everywhere.

Where it earns its keep:

  • Probability. Tossing coins, drawing cards, modelling errors — the rows of the triangle are the binomial distribution. The row-55 entries told us, with no extra work, how three-heads-in-five splits across all outcomes.

  • Algebra. Expanding (a+b)n(a+b)^n by hand is slow; the triangle reads off the coefficients instantly, which is why it underpins the binomial theorem.

  • Finance and computing. The binomial option-pricing model and many recursive algorithms lean on the same add-the-two-above structure.

The destination here is the binomial theorem: once you trust that row nn holds the coefficients of (a+b)n(a+b)^n, you can expand a power without multiplying anything out — and that shortcut scales to expansions far too large to draw a triangle for.

Where Students Trip Up on Pascal's Triangle

Mistake 1: Counting rows from one instead of zero

Where it slips in: When a problem asks for the coefficients of (a+b)n(a+b)^n and the student counts down to "the nnth row I wrote."

Don't do this: Treating 1,2,11, 2, 1 as the row for (a+b)3(a+b)^3 because it is the third line on the page.

The correct way: The apex is row 00. Row 22 (1,2,11, 2, 1) belongs to (a+b)2(a+b)^2; row 33 (1,3,3,11, 3, 3, 1) belongs to (a+b)3(a+b)^3. Counting from 00 aligns the row index with the exponent.

Mistake 2: Forgetting the descending and ascending powers

Where it slips in: When writing the expansion after correctly reading off the coefficients.

Don't do this: Writing (a+b)4=a4+4a3+6a2+4a+1(a+b)^4 = a^4 + 4a^3 + 6a^2 + 4a + 1, attaching the coefficients to powers of aa alone and dropping bb.

The correct way: Each term carries both variables: the power of aa falls from nn to 00 while the power of bb rises from 00 to nn, and the two exponents always add to nn. The most common version of this error is dropping the middle term entirely — the a4+b4a^4 + b^4 habit — exactly the kind of slip that defining "every term's exponents sum to nn" is meant to catch before it happens.

Mistake 3: Misreading positions in the choose formula

Where it slips in: When jumping to a single entry with (nr)\binom{n}{r} instead of building the row.

Don't do this: Computing (62)\binom{6}{2} as 6!2!\frac{6!}{2!} and forgetting the (n−r)!(n-r)! in the denominator, which gives 360360 instead of 1515.

The correct way: Always write the full denominator r!,(n−r)!r!,(n-r)!. The skipped (n−r)!(n-r)! is the single quietest source of wrong binomial coefficients, and it never shows up if you write the formula out in full before substituting.

A real version of this counting blind spot shows up outside the classroom. Early lottery and insurance miscalculations came from undercounting the number of ways outcomes can combine — exactly what the triangle's entries measure. The British actuary tables of the eighteenth century leaned on binomial-coefficient reasoning to price risk correctly; getting the combination count wrong meant mispricing real money, which is why binomial-coefficient methods became foundational to actuarial science.

Build It Before You Memorise the Formula

Introducing Pascal's Triangle by hand before the binomial-coefficient formula means students see why the coefficients are what they are rather than memorising (nr)\binom{n}{r} cold. Building three or four rows yourself makes the add-the-two-above rule permanent in a way a formula sheet never does — it is exactly how a Bhanzu trainer would open the topic.

Conclusion

  • Pascal's Triangle is a number array where each interior entry is the sum of the two directly above it, and the edges are always 11.

  • Row nn (apex is row 00) holds the coefficients of (a+b)n(a+b)^n and equals the binomial coefficients (nr)\binom{n}{r}.

  • Its built-in patterns include power-of-two row sums, left-right symmetry, the triangular numbers on a diagonal, and Fibonacci numbers on shallow diagonals.

  • The most common mistakes are counting rows from 11, dropping a variable in the expansion, and forgetting the (n−r)!(n-r)! in the choose formula.

  • The triangle is the natural on-ramp to the binomial theorem and to combination counting in probability.

Practice These to Solidify Your Understanding

Work through these in order, then check each against the triangle:

  1. Write out rows 00 through 66 of Pascal's Triangle.

  2. Expand (x+1)5(x + 1)^5 using the correct row.

  3. Compute (83)\binom{8}{3} with the choose formula and confirm it against row 88.

  4. In how many ways can exactly four heads appear in six coin tosses?

If the expansion in question 22 goes wrong, come back to the "descending and ascending powers" mistake above. To build this with a live trainer who shows you the triangle before the formula, explore Bhanzu's algebra tutor or help with algebra sessions, or browse math classes online. Want a trainer to walk through more Pascal's Triangle problems? Book a free demo class.

Read More

Was this article helpful?

Your feedback helps us write better content

Frequently Asked Questions

What is Pascal's Triangle used for?
Mostly two things: reading off the coefficients of a binomial expansion (a+b)n(a+b)^n without multiplying, and counting combinations in probability (how many ways to get rr successes in nn trials). It also turns up in the binomial distribution, option-pricing models, and recursive algorithms.
Why is each number the sum of the two above it?
Because of Pascal's rule, (nr)=(n−1r−1)+(n−1r)\binom{n}{r} = \binom{n-1}{r-1} + \binom{n-1}{r}. Choosing rr items from nn either includes a particular item (then choose r−1r-1 from the rest) or excludes it (choose rr from the rest) — adding those two counts gives the entry below.
What row does (a+b)^n use?
Row nn, where the apex is row 00. So (a+b)5(a+b)^5 uses row 55: 1,5,10,10,5,11, 5, 10, 10, 5, 1.
Is Pascal's Triangle the same as the binomial theorem?
No. The triangle is a way to find binomial coefficients by addition; the binomial theorem is the formula that uses those coefficients to write the full expansion. The triangle is the table; the theorem is the rule that reads it
How do I find a single entry without drawing the whole triangle?
Use (nr)=n!r!,(n−r)!\binom{n}{r} = \dfrac{n!}{r!,(n-r)!}. For row 77, position 33: (73)=7!3!,4!=35\binom{7}{3} = \dfrac{7!}{3!,4!} = 35
✍️ Written By
BT
Bhanzu Team
Content Creator and Editor
Bhanzu’s editorial team, known as Team Bhanzu, is made up of experienced educators, curriculum experts, content strategists, and fact-checkers dedicated to making math simple and engaging for learners worldwide. Every article and resource is carefully researched, thoughtfully structured, and rigorously reviewed to ensure accuracy, clarity, and real-world relevance. We understand that building strong math foundations can raise questions for students and parents alike. That’s why Team Bhanzu focuses on delivering practical insights, concept-driven explanations, and trustworthy guidance-empowering learners to develop confidence, speed, and a lifelong love for mathematics.
Related Articles
Book a FREE Demo ClassBook Now →