Skip to main content
Mathematics LibreTexts

15.7: Pascal's Triangle

  • Page ID
    248119
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \( \newcommand{\dsum}{\displaystyle\sum\limits} \)

    \( \newcommand{\dint}{\displaystyle\int\limits} \)

    \( \newcommand{\dlim}{\displaystyle\lim\limits} \)

    \( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)

    ( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\id}{\mathrm{id}}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\kernel}{\mathrm{null}\,}\)

    \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\)

    \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\)

    \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    \( \newcommand{\vectorA}[1]{\vec{#1}}      % arrow\)

    \( \newcommand{\vectorAt}[1]{\vec{\text{#1}}}      % arrow\)

    \( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vectorC}[1]{\textbf{#1}} \)

    \( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)

    \( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)

    \( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)

    \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \(\newcommand{\longvect}{\overrightarrow}\)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \(\newcommand{\ket}[1]{\left| #1 \right>}\)
    \(\newcommand{\bra}[1]{\left< #1 \right|}\)
    \(\newcommand{\braket}[2]{\left< #1 \vphantom{#2} \right| \left. #2 \vphantom{#1} \right>}\)
    \(\newcommand{\braopket}[3]{\left< #1 \vphantom{#2}\vphantom{#3} \right| #2 \vphantom{#1}\vphantom{#3} \left| #3 \vphantom{#1}\vphantom{#2} \right>}\)
    \(\newcommand{\qmvec}[1]{\mathbf{\vec{#1}}}\)
    \(\newcommand{\op}[1]{\hat{\mathbf{#1}}}\)
    \(\newcommand{\expect}[1]{\langle #1 \rangle}\)
    \(\newcommand{\dfn}[1]{\emph{\textbf{#1}}}\)

    \(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)

    Videos

    Lecture: Pascal's Triangle and Powers of Binomials

    Definitions and Theorems

    Definition: Factorial

    For a nonnegative integer \(n\), the factorial of \(n\), written \(n!\), is the product of all positive integers less than or equal to \(n\):\[n! = n(n-1)(n-2)\cdots(3)(2)(1),\nonumber\]with the convention that \(0! = 1\).

    Definition: Binomial Coefficient

    Let \(n\) and \(k\) be integers with \(0 \leq k \leq n\). The binomial coefficient \(\binom{n}{k}\), read "\(n\) choose \(k\)," is defined by\[\binom{n}{k} = \dfrac{n!}{k!\,(n-k)!}.\nonumber\]

    Notation: Binomial Coefficients

    The binomial coefficient \(\binom{n}{k}\) is also written \({}_{n}C_{k}\) or \(C(n,k)\), and is the number of ways to choose \(k\) objects from a collection of \(n\) distinct objects without regard to order. All three notations denote the same number; this text uses \(\binom{n}{k}\) throughout.

    Definition: Pascal's Triangle

    Pascal's Triangle is the triangular array whose entries are the binomial coefficients, arranged so that the entry in position \(k\) of row \(n\) is \(\binom{n}{k}\). Both the rows and the positions within a row are numbered beginning with \(0\).

    Rows \(0\) through \(6\) of Pascal's Triangle are shown below, top to bottom.

    \[\begin{array}{ccccccccccccc} & & & & & & 1 & & & & & & \\ & & & & & 1 & & 1 & & & & & \\ & & & & 1 & & 2 & & 1 & & & & \\ & & & 1 & & 3 & & 3 & & 1 & & & \\ & & 1 & & 4 & & 6 & & 4 & & 1 & & \\ & 1 & & 5 & & 10 & & 10 & & 5 & & 1 & \\ 1 & & 6 & & 15 & & 20 & & 15 & & 6 & & 1 \end{array}\nonumber\]

    In binomial coefficient form, the first three rows are\[\begin{array}{ccccc} & & \binom{0}{0} & & \\ & \binom{1}{0} & & \binom{1}{1} & \\ \binom{2}{0} & & \binom{2}{1} & & \binom{2}{2} \end{array}\nonumber\]

    Caution: Counting from Zero

    Row \(n\) is the \((n+1)\)st row of the array, and position \(k\) is the \((k+1)\)st entry of that row. Row \(5\) is therefore \(1,\ 5,\ 10,\ 10,\ 5,\ 1\), not \(1,\ 4,\ 6,\ 4,\ 1\). Counting rows or positions from \(1\) is the most common source of error in reading coefficients off the triangle.

    Theorem: Pascal's Rule

    For integers \(n\) and \(k\) with \(1 \leq k \leq n-1\),\[\binom{n}{k} = \binom{n-1}{k-1} + \binom{n-1}{k}.\nonumber\]

    Note: Building the Triangle

    Pascal's Rule is the construction rule for the array. Each row begins and ends with \(1\), since \(\binom{n}{0} = \binom{n}{n} = 1\), and every interior entry is the sum of the two entries immediately above it to the left and to the right. Consequently a new row can be generated by addition alone, with no factorials computed.

    Theorem: Symmetry of the Binomial Coefficients

    For integers \(n\) and \(k\) with \(0 \leq k \leq n\),\[\binom{n}{k} = \binom{n}{n-k}.\nonumber\]

    Theorem: Sum of a Row

    For every nonnegative integer \(n\), the entries of row \(n\) of Pascal's Triangle sum to \(2^{n}\):\[\binom{n}{0} + \binom{n}{1} + \binom{n}{2} + \cdots + \binom{n}{n} = 2^{n}.\nonumber\]

    Theorem: The Binomial Theorem

    For every nonnegative integer \(n\) and all real numbers \(x\) and \(y\),\[(x+y)^{n} = \binom{n}{0}x^{n} + \binom{n}{1}x^{n-1}y + \binom{n}{2}x^{n-2}y^{2} + \cdots + \binom{n}{n}y^{n}.\nonumber\]The coefficients appearing in this expansion are precisely the entries of row \(n\) of Pascal's Triangle.

    Note: Structure of the Expansion

    In the expansion of \((x+y)^{n}\) there are \(n+1\) terms. Reading left to right, the exponent on \(x\) decreases from \(n\) to \(0\) while the exponent on \(y\) increases from \(0\) to \(n\); in every term the two exponents sum to \(n\). The general term is\[\binom{n}{k}x^{n-k}y^{k},\nonumber\]which is the term of position \(k\), counting from \(k=0\).

    Caution: Expanding a Difference

    To expand \((x-y)^{n}\), apply the Binomial Theorem to \(\big(x + (-y)\big)^{n}\). The factor \((-y)^{k}\) is negative exactly when \(k\) is odd, so the signs of the terms alternate. Likewise, when a term of the binomial carries a coefficient, as in \((2x-3)^{n}\), the entire quantity \(2x\) is raised to the power — the coefficient \(2\) is raised to that power along with \(x\).

    Examples

    Example \(\PageIndex{1}\): Evaluating Binomial Coefficients

    Evaluate each binomial coefficient using the factorial definition.

    1. \(\binom{9}{4}\)
    2. \(\binom{9}{5}\)
    3. \(\binom{12}{0}\)
    Solutions
    1. Substitute \(n = 9\) and \(k = 4\) into the definition. Expanding \(9!\) only as far as \(5!\) allows that factor to cancel against the \(5!\) in the denominator.\[\begin{aligned} \binom{9}{4} &= \dfrac{9!}{4!\,(9-4)!} \\ &= \dfrac{9!}{4!\,5!} \\ &= \dfrac{9 \cdot 8 \cdot 7 \cdot 6 \cdot 5!}{4!\,5!} \\ &= \dfrac{9 \cdot 8 \cdot 7 \cdot 6}{4 \cdot 3 \cdot 2 \cdot 1} \\ &= \dfrac{3024}{24} \\ &= 126 \end{aligned}\nonumber\]
    2. Substitute \(n = 9\) and \(k = 5\). The denominator is \(5!\,4!\), which is the same product as in part (a).\[\binom{9}{5} = \dfrac{9!}{5!\,(9-5)!} = \dfrac{9!}{5!\,4!} = 126\nonumber\]This agrees with the Symmetry of the Binomial Coefficients, since \(9 - 4 = 5\).
    3. Substitute \(n = 12\) and \(k = 0\), and apply the convention \(0! = 1\).\[\binom{12}{0} = \dfrac{12!}{0!\,(12-0)!} = \dfrac{12!}{1 \cdot 12!} = 1\nonumber\]
    Example \(\PageIndex{2}\): Generating a New Row

    Row \(6\) of Pascal's Triangle is \(1,\ 6,\ 15,\ 20,\ 15,\ 6,\ 1\). Use Pascal's Rule to generate row \(7\).

    Solution

    Row \(7\) has \(8\) entries. The first and last are \(1\), since \(\binom{7}{0} = \binom{7}{7} = 1\). Each interior entry is the sum of the two entries of row \(6\) lying immediately above it.

    \[\begin{aligned} \binom{7}{1} &= 1 + 6 = 7 \\ \binom{7}{2} &= 6 + 15 = 21 \\ \binom{7}{3} &= 15 + 20 = 35 \\ \binom{7}{4} &= 20 + 15 = 35 \\ \binom{7}{5} &= 15 + 6 = 21 \\ \binom{7}{6} &= 6 + 1 = 7 \end{aligned}\nonumber\]

    Row \(7\) is therefore\[1,\ 7,\ 21,\ 35,\ 35,\ 21,\ 7,\ 1.\nonumber\]As a check, the entries sum to \(128 = 2^{7}\), as required by the Sum of a Row, and the row reads the same forward and backward, as required by symmetry.

    Example \(\PageIndex{3}\): Expanding a Sum of Two Variables

    Expand \((x+y)^{5}\).

    Solution

    The exponent is \(5\), so the coefficients are the entries of row \(5\) of Pascal's Triangle:\[1,\ 5,\ 10,\ 10,\ 5,\ 1.\nonumber\]Attach these coefficients to the terms \(x^{5-k}y^{k}\) for \(k = 0,1,2,3,4,5\), so that the exponent on \(x\) decreases from \(5\) while the exponent on \(y\) increases from \(0\).

    \[(x+y)^{5} = x^{5} + 5x^{4}y + 10x^{3}y^{2} + 10x^{2}y^{3} + 5xy^{4} + y^{5}\nonumber\]

    The expansion has \(6\) terms, and the exponents in each term sum to \(5\).

    Example \(\PageIndex{4}\): Expanding a Binomial with Coefficients

    Expand \((2x-3)^{4}\).

    Solution

    Write the binomial as a sum, \(\big(2x + (-3)\big)^{4}\), so that the Binomial Theorem applies directly with \(2x\) in place of \(x\) and \(-3\) in place of \(y\). The exponent is \(4\), so the coefficients are the entries of row \(4\):\[1,\ 4,\ 6,\ 4,\ 1.\nonumber\]Form each term as \(\binom{4}{k}(2x)^{4-k}(-3)^{k}\).

    \[\begin{aligned} k = 0: \quad & 1 \cdot (2x)^{4}(-3)^{0} = 16x^{4} \\ k = 1: \quad & 4 \cdot (2x)^{3}(-3)^{1} = 4 \cdot 8x^{3} \cdot (-3) = -96x^{3} \\ k = 2: \quad & 6 \cdot (2x)^{2}(-3)^{2} = 6 \cdot 4x^{2} \cdot 9 = 216x^{2} \\ k = 3: \quad & 4 \cdot (2x)^{1}(-3)^{3} = 4 \cdot 2x \cdot (-27) = -216x \\ k = 4: \quad & 1 \cdot (2x)^{0}(-3)^{4} = 81 \end{aligned}\nonumber\]

    Summing the terms gives\[(2x-3)^{4} = 16x^{4} - 96x^{3} + 216x^{2} - 216x + 81.\nonumber\]The signs alternate because \((-3)^{k}\) is negative exactly when \(k\) is odd.

    Example \(\PageIndex{5}\): Finding a Single Coefficient

    Find the coefficient of \(x^{3}\) in the expansion of \((3x-2)^{7}\).

    Solution

    The general term of the expansion is\[\binom{7}{k}(3x)^{7-k}(-2)^{k},\nonumber\]whose power of \(x\) is \(x^{7-k}\). The term containing \(x^{3}\) is the one for which\[7 - k = 3,\nonumber\]so \(k = 4\). Only that single term is needed; the full expansion is unnecessary.

    From row \(7\) of Pascal's Triangle, \(\binom{7}{4} = 35\). Evaluate the term.

    \[\begin{aligned} \binom{7}{4}(3x)^{3}(-2)^{4} &= 35 \cdot 27x^{3} \cdot 16 \\ &= 15120x^{3} \end{aligned}\nonumber\]

    The coefficient of \(x^{3}\) is \(15120\). It is positive because \(k = 4\) is even.

    Example \(\PageIndex{6}\): Locating the Constant Term

    Find the constant term in the expansion of \(\left(x^{2} - \frac{2}{x}\right)^{6}\).

    Solution

    Rewrite the second term of the binomial with a negative exponent, \(-\frac{2}{x} = -2x^{-1}\), so that the powers of \(x\) can be combined. The general term is\[\binom{6}{k}\left(x^{2}\right)^{6-k}\left(-2x^{-1}\right)^{k}.\nonumber\]Separate the numerical factors from the powers of \(x\).

    \[\begin{aligned} \binom{6}{k}\left(x^{2}\right)^{6-k}\left(-2x^{-1}\right)^{k} &= \binom{6}{k}(-2)^{k}\, x^{2(6-k)} \cdot x^{-k} \\ &= \binom{6}{k}(-2)^{k}\, x^{12-2k-k} \\ &= \binom{6}{k}(-2)^{k}\, x^{12-3k} \end{aligned}\nonumber\]

    The constant term is the term whose power of \(x\) is \(x^{0}\), so set the exponent equal to \(0\) and solve.

    \[\begin{aligned} 12 - 3k &= 0 \\ 3k &= 12 \\ k &= 4 \end{aligned}\nonumber\]

    Since \(k = 4\) is an integer with \(0 \leq 4 \leq 6\), such a term exists. From row \(6\) of Pascal's Triangle, \(\binom{6}{4} = 15\). Evaluate the term.

    \[\begin{aligned} \binom{6}{4}(-2)^{4} &= 15 \cdot 16 \\ &= 240 \end{aligned}\nonumber\]

    The constant term is \(240\).


    Sources

    Several parts of this text use modifications from the following sources:

    All of these sources are released under the Creative Commons Attribution-Share-Alike License 4.0.


    This page titled 15.7: Pascal's Triangle was last modified on Mon, 02 Nov 2026 20:18:30 GMT and is shared under a CC BY-NC-SA 4.0 license and was authored, remixed, and/or curated by Kristine Woods.

    • Was this article helpful?