Table of Contents |
Recall that a binomial is a polynomial with two terms. While we have raised binomials to powers 2 and sometimes 3, raising a binomial to a higher power would be very tedious and time-consuming. We will explore a method to expand
without performing multiplication. Such an expansion is called a binomial expansion.
The table below shows the expansions of
assuming
If you like, you can verify these for yourself by performing the necessary multiplications.
and Its Expansion
|
Coefficients in Order of Descending Powers of x |
|---|---|
|
1 |
|
1, 1 |
|
1, 2, 1 |
|
1, 3, 3, 1 |
|
1, 4, 6, 4, 1 |
Notice that the coefficient column makes up a triangular pattern. This pattern is called Pascal’s triangle, and the numbers in the triangle are called binomial coefficients since they are coefficients of terms in the expansions of
where n is a nonnegative integer.
A more formal version of Pascal’s triangle is shown below.
Properties of Pascal’s triangle:
are in row n. For example, row 3 has coefficients 1, 3, 3, 1 and
EXAMPLE
Use Pascal’s triangle to write the expansion of
and
is
As it turns out, each binomial coefficient can be calculated by using a formula.
The notation
is used to represent a binomial coefficient. Relating to Pascal’s triangle, the value of
is in row n, position k, where the first position in each row corresponds to
Written in terms of binomial coefficients, the first few rows of Pascal’s triangle is shown below:
This all said, we have the following formula to compute a binomial coefficient.

The expression
is called a combination, and when referring to it, we say “n choose k.”
and
EXAMPLE
Compute
|
This is the formula for computing a binomial coefficient. |
|
Simplify in the denominator.
|
|
Expand each factorial. |
|
Cancel each common factor and factor of 1. |
|
Simplify. |
To verify this, look at Pascal’s triangle at the beginning of this lesson, go to row 5, position 2 (remember that the first “1” is in the zero position), and that number is 10.
which is equal to
Notice that the “4” and “3” in the denominator add up to 7, the number whose factorial is in the numerator. This is a nice “shortcut” to computing binomial coefficients since you can quickly figure out the other term in the denominator rather than substituting n and k directly into the formula.
gives the number of distinct groups of k objects that can be selected from a group of n objects, where order does not matter. For example, the expression
gives the number of groups of three students that can be selected from a group of 10 students, where no group contains the same three students and the order of the selection of the students does not matter.
The binomial theorem can be used to find the expansion of a binomial that is raised to a nonnegative integer power.
Notice that the “k” in the binomial coefficient corresponds to the power of the second term of the binomial.
Let’s first use the theorem to verify a previous result.
EXAMPLE
Use the binomial theorem to find the expansion of


and
simplify each exponent and evaluate each binomial coefficient:



which coincides with the result shown earlier.
We can use the binomial theorem to expand more complicated binomials that are raised to a power.
The binomial theorem can also be used to find the coefficients of specific terms in a binomial expansion.
EXAMPLE
Find the coefficient of
in the binomial expansion of
|
Start with the binomial expansion of since we want to expand another binomial to the 9th power.
|
|
Replace with and b with to obtain the binomial expansion of
|
as the variable part, let
|
Substitute into Remember that the power of y determines the value of k. Since the term contains this means
|
|
Expand the exponential factors. |
|
Evaluate the binomial coefficient, then group the factors with all constants together and all variables together. |
|
Simplify. |
in the expansion of
is 2,520,000.
without performing multiplications on binomials. Each term in a binomial expansion has a numerical factor called a binomial coefficient. You also learned that the binomial coefficients are visually represented using Pascal’s triangle and can be found by evaluating
SOURCE: THIS TUTORIAL HAS BEEN ADAPTED FROM OPENSTAX "PRECALCULUS” BY JAY ABRAMSON. ACCESS FOR FREE AT OPENSTAX.ORG/DETAILS/BOOKS/PRECALCULUS-2E. LICENSE: CREATIVE COMMONS ATTRIBUTION 4.0 INTERNATIONAL.