Study guide

5.4 The Binomial Theorem & Expansions

CLEP College Algebra Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Introduction & Exam Overview

1.1 About the CLEP College Algebra Exam 1.2 Study Strategy & TI-30XS Calculator Mastery

2 Chapter 2: Algebraic Operations

2.1 Algebraic Expressions & Operations 2.2 Exponents & Scientific Notation 2.3 Factoring & Expanding Polynomials 2.4 Rational Expressions & Complex Fractions 2.5 Absolute Value & Radicals 2.6 Logarithmic Properties & Simplification

3 Chapter 3: Equations and Inequalities

3.1 Linear Equations & Linear Inequalities 3.2 Linear Functions, Slope & Graphs of Lines 3.3 Quadratic Equations & Quadratic Inequalities 3.4 Absolute Value Equations & Absolute Value Inequalities 3.5 Systems of Linear & Nonlinear Equations and Inequalities 3.6 Exponential & Logarithmic Equations

4 Chapter 4: Functions and Their Properties

4.1 Concept of a Function, Evaluation, Domain & Range 4.2 Representing & Modeling Functions: Verbal, Numerical, Graphical, Symbolic 4.3 Graphs of Functions, Intercepts, & Symmetry 4.4 Transformations of Functions 4.5 Algebra of Functions & Function Composition 4.6 Inverse Functions & Their Properties 4.7 Special Function Types: Polynomial, Rational, Piecewise & Power

5 Chapter 5: Number Systems and Operations

5.1 Real Number System & Order of Operations 5.2 Complex Numbers & Complex Arithmetic 5.3 Sequences, Series, & Factorials 5.4 The Binomial Theorem & Expansions

5.4 The Binomial Theorem & Expansions

Key Takeaways Explain This Topic AI

The binomial coefficient n choose r equals n!/(r!(n - r)!), counts combinations, fills Pascal’s Triangle, and satisfies the symmetry n choose r = n choose (n - r).

The Binomial Theorem expands (a + b)^n into exactly n + 1 terms, each of the form (n choose k) * a^(n-k) * b^k, with the exponents in every term summing to n.

The entries in row n of Pascal’s Triangle sum to 2^n and supply the coefficients for low-degree binomial expansions without any factorial arithmetic.

The general term formula T_(k+1) = (n choose k) * a^(n-k) * b^k isolates one specific term, such as the constant term, without performing the full expansion.

Last updated: August 2026

5.4 The Binomial Theorem & Expansions

Expanding powers of a binomial expression ( a + b ) n (a + b)^n ( a + b ) n by repeated polynomial multiplication quickly becomes computationally inefficient for higher exponents n n n . The Binomial Theorem solves this challenge by providing a direct algebraic formula for expanding any power of a binomial using binomial coefficients and combinatorial identities.

Combinations & Binomial Coefficients

The binomial coefficient ( n r ) \binom{n}{r} ( r n ​ ) (read " n n n choose r r r ") represents the number of ways to select a subset of r r r un-ordered elements from a set of n n n distinct elements. ( n r ) = n C r = n ! r ! ( n − r ) ! for 0 ≤ r ≤ n \binom{n}{r} = {}_n C_r = \frac{n!}{r!(n - r)!} \quad \text{for } 0 \le r \le n ( r n ​ ) = n ​ C r ​ = r ! ( n − r )! n ! ​ for 0 ≤ r ≤ n

Fundamental Algebraic Properties

Boundary Values: ( n 0 ) = n ! 0 ! n ! = 1 \binom{n}{0} = \frac{n!}{0! n!} = 1 ( 0 n ​ ) = 0 ! n ! n ! ​ = 1 and ( n n ) = n ! n ! 0 ! = 1 \binom{n}{n} = \frac{n!}{n! 0!} = 1 ( n n ​ ) = n ! 0 ! n ! ​ = 1 .

Symmetry Identity: ( n r ) = ( n n − r ) \binom{n}{r} = \binom{n}{n - r} ( r n ​ ) = ( n − r n ​ ) .

Pascal's Identity: ( n r ) + ( n r − 1 ) = ( n + 1 r ) \binom{n}{r} + \binom{n}{r - 1} = \binom{n + 1}{r} ( r n ​ ) + ( r − 1 n ​ ) = ( r n + 1 ​ ) .

Pascal's Triangle

Pascal's Triangle is a triangular array of numbers where row n n n lists the binomial coefficients ( n 0 ) , ( n 1 ) , … , ( n n ) \binom{n}{0}, \binom{n}{1}, \dots, \binom{n}{n} ( 0 n ​ ) , ( 1 n ​ ) , … , ( n n ​ ) . Each interior number is formed by adding the two numbers directly above it (reflecting Pascal's Identity). Row 0: 1

  • Row 1: 1 1
  • Row 2: 1 2 1
  • Row 3: 1 3 3 1
  • Row 4: 1 4 6 4 1
  • Row 5: 1 5 10 10 5 1
  • Row 6: 1 6 15 20 15 6 1
  • Key Structural Properties

Row Sum Identity: The sum of all binomial coefficients in row n n n equals 2 n 2^n 2 n : ∑ k = 0 n ( n k ) = ( n 0 ) + ( n 1 ) + ⋯ + ( n n ) = 2 n \sum_{k=0}^n \binom{n}{k} = \binom{n}{0} + \binom{n}{1} + \dots + \binom{n}{n} = 2^n k = 0 ∑ n ​ ( k n ​ ) = ( 0 n ​ ) + ( 1 n ​ ) + ⋯ + ( n n ​ ) = 2 n

Symmetric Balance: Each row reads identically forward and backward.

The Binomial Theorem Formula

For any real numbers a , b a, b a , b and non-negative integer n n n : ( a + b ) n = ∑ k = 0 n ( n k ) a n − k b k = ( n 0 ) a n + ( n 1 ) a n − 1 b + ( n 2 ) a n − 2 b 2 + ⋯ + ( n n ) b n (a + b)^n = \sum_{k=0}^n \binom{n}{k} a^{n-k} b^k = \binom{n}{0}a^n + \binom{n}{1}a^{n-1}b + \binom{n}{2}a^{n-2}b^2 + \dots + \binom{n}{n}b^n ( a + b ) n = k = 0 ∑ n ​ ( k n ​ ) a n − k b k = ( 0 n ​ ) a n + ( 1 n ​ ) a n − 1 b + ( 2 n ​ ) a n − 2 b 2 + ⋯ + ( n n ​ ) b n

Key Expansion Rules

Total Number of Terms: Expanding ( a + b ) n (a + b)^n ( a + b ) n produces exactly n + 1 n + 1 n + 1 terms.

Exponent Behavior: The exponent of a a a starts at n n n and decreases by 1 1 1 in each term down to 0 0 0 . The exponent of b b b starts at 0 0 0 and increases by 1 1 1 in each term up to n n n .

Homogeneity: The sum of exponents of a a a and b b b in every term is constant and equals n n n ( n − k + k = n n - k + k = n n − k + k = n ).

Alternating Signs: When expanding ( a − b ) n (a - b)^n ( a − b ) n , replace b b b with ( − b ) (-b) ( − b ) . Terms with odd powers of b b b become negative, causing signs to alternate: + , − , + , − … + , - , + , - \dots + , − , + , − …

Finding a Specific Term (General Term Formula)

Instead of computing the complete polynomial expansion, any individual term in ( a + b ) n (a + b)^n ( a + b ) n can be targeted using the general term formula for the ( k + 1 ) (k + 1) ( k + 1 ) -th term: T k + 1 = ( n k ) a n − k b k T_{k+1} = \binom{n}{k} a^{n-k} b^k T k + 1 ​ = ( k n ​ ) a n − k b k

Important Indexing Rule: The index k k k is always 1 1 1 less than the term position number. For instance, to find the 4th term ( T 4 T_4 T 4 ​ ), substitute k = 3 k = 3 k = 3 .

  • Comprehensive Worked Examples
  • Worked Example 1: Calculating Binomial Coefficients

Problem: Calculate the binomial coefficient ( 8 3 ) \binom{8}{3} ( 3 8 ​ ) , state its symmetric counterpart, and verify row symmetry.

Step-by-Step Solution:

Apply combination formula: ( 8 3 ) = 8 ! 3 ! ( 8 − 3 ) ! = 8 ! 3 ! 5 ! = 8 × 7 × 6 3 × 2 × 1 = 336 6 = 56 \binom{8}{3} = \frac{8!}{3!(8 - 3)!} = \frac{8!}{3! 5!} = \frac{8 \times 7 \times 6}{3 \times 2 \times 1} = \frac{336}{6} = 56 ( 3 8 ​ ) = 3 ! ( 8 − 3 )! 8 ! ​ = 3 ! 5 ! 8 ! ​ = 3 × 2 × 1 8 × 7 × 6 ​ = 6 336 ​ = 56

Apply symmetry property ( n r ) = ( n n − r ) \binom{n}{r} = \binom{n}{n - r} ( r n ​ ) = ( n − r n ​ ) : ( 8 3 ) = ( 8 8 − 3 ) = ( 8 5 ) = 56 \binom{8}{3} = \binom{8}{8 - 3} = \binom{8}{5} = 56 ( 3 8 ​ ) = ( 8 − 3 8 ​ ) = ( 5 8 ​ ) = 56

Worked Example 2: Step-by-Step Expansion of ( 2 x − y ) 5 (2x - y)^5 ( 2 x − y ) 5

Problem: Expand ( 2 x − y ) 5 (2x - y)^5 ( 2 x − y ) 5 fully using the Binomial Theorem.

Step-by-Step Solution:

Retrieve row 5 coefficients from Pascal's Triangle: 1 , 5 , 10 , 10 , 5 , 1 1, 5, 10, 10, 5, 1 1 , 5 , 10 , 10 , 5 , 1 .

Set up general terms with a = 2 x a = 2x a = 2 x and b = − y b = -y b = − y :

k = 0 : ( 5 0 ) ( 2 x ) 5 ( − y ) 0 = 1 ⋅ ( 32 x 5 ) ⋅ 1 = 32 x 5 k=0: \binom{5}{0} (2x)^5 (-y)^0 = 1 \cdot (32x^5) \cdot 1 = 32x^5 k = 0 : ( 0 5 ​ ) ( 2 x ) 5 ( − y ) 0 = 1 ⋅ ( 32 x 5 ) ⋅ 1 = 32 x 5

k = 1 : ( 5 1 ) ( 2 x ) 4 ( − y ) 1 = 5 ⋅ ( 16 x 4 ) ⋅ ( − y ) = − 80 x 4 y k=1: \binom{5}{1} (2x)^4 (-y)^1 = 5 \cdot (16x^4) \cdot (-y) = -80x^4 y k = 1 : ( 1 5 ​ ) ( 2 x ) 4 ( − y ) 1 = 5 ⋅ ( 16 x 4 ) ⋅ ( − y ) = − 80 x 4 y

k = 2 : ( 5 2 ) ( 2 x ) 3 ( − y ) 2 = 10 ⋅ ( 8 x 3 ) ⋅ ( y 2 ) = 80 x 3 y 2 k=2: \binom{5}{2} (2x)^3 (-y)^2 = 10 \cdot (8x^3) \cdot (y^2) = 80x^3 y^2 k = 2 : ( 2 5 ​ ) ( 2 x ) 3 ( − y ) 2 = 10 ⋅ ( 8 x 3 ) ⋅ ( y 2 ) = 80 x 3 y 2

k = 3 : ( 5 3 ) ( 2 x ) 2 ( − y ) 3 = 10 ⋅ ( 4 x 2 ) ⋅ ( − y 3 ) = − 40 x 2 y 3 k=3: \binom{5}{3} (2x)^2 (-y)^3 = 10 \cdot (4x^2) \cdot (-y^3) = -40x^2 y^3 k = 3 : ( 3 5 ​ ) ( 2 x ) 2 ( − y ) 3 = 10 ⋅ ( 4 x 2 ) ⋅ ( − y 3 ) = − 40 x 2 y 3

k = 4 : ( 5 4 ) ( 2 x ) 1 ( − y ) 4 = 5 ⋅ ( 2 x ) ⋅ ( y 4 ) = 10 x y 4 k=4: \binom{5}{4} (2x)^1 (-y)^4 = 5 \cdot (2x) \cdot (y^4) = 10x y^4 k = 4 : ( 4 5 ​ ) ( 2 x ) 1 ( − y ) 4 = 5 ⋅ ( 2 x ) ⋅ ( y 4 ) = 10 x y 4

k = 5 : ( 5 5 ) ( 2 x ) 0 ( − y ) 5 = 1 ⋅ 1 ⋅ ( − y 5 ) = − y 5 k=5: \binom{5}{5} (2x)^0 (-y)^5 = 1 \cdot 1 \cdot (-y^5) = -y^5 k = 5 : ( 5 5 ​ ) ( 2 x ) 0 ( − y ) 5 = 1 ⋅ 1 ⋅ ( − y 5 ) = − y 5

Combine terms into expanded polynomial: ( 2 x − y ) 5 = 32 x 5 − 80 x 4 y + 80 x 3 y 2 − 40 x 2 y 3 + 10 x y 4 − y 5 (2x - y)^5 = 32x^5 - 80x^4 y + 80x^3 y^2 - 40x^2 y^3 + 10xy^4 - y^5 ( 2 x − y ) 5 = 32 x 5 − 80 x 4 y + 80 x 3 y 2 − 40 x 2 y 3 + 10 x y 4 − y 5

Worked Example 3: Finding a Constant Term

Problem: Find the constant term (the term independent of x x x ) in the expansion of ( 2 x 3 − 1 x ) 4 \left( 2x^3 - \frac{1}{x} \right)^4 ( 2 x 3 − x 1 ​ ) 4 .

Step-by-Step Solution:

Write general term T k + 1 T_{k+1} T k + 1 ​ with a = 2 x 3 a = 2x^3 a = 2 x 3 , b = − x − 1 b = -x^{-1} b = − x − 1 , and n = 4 n = 4 n = 4 : T k + 1 = ( 4 k ) ( 2 x 3 ) 4 − k ( − x − 1 ) k T_{k+1} = \binom{4}{k} \left( 2x^3 \right)^{4-k} \left( -x^{-1} \right)^k T k + 1 ​ = ( k 4 ​ ) ( 2 x 3 ) 4 − k ( − x − 1 ) k

Separate scalar numbers from powers of x x x : T k + 1 = ( 4 k ) 2 4 − k ( − 1 ) k ⋅ x 3 ( 4 − k ) x − k = ( 4 k ) 2 4 − k ( − 1 ) k ⋅ x 12 − 3 k − k = ( 4 k ) 2 4 − k ( − 1 ) k ⋅ x 12 − 4 k T_{k+1} = \binom{4}{k} 2^{4-k} (-1)^k \cdot x^{3(4-k)} x^{-k} = \binom{4}{k} 2^{4-k} (-1)^k \cdot x^{12 - 3k - k} = \binom{4}{k} 2^{4-k} (-1)^k \cdot x^{12 - 4k} T k + 1 ​ = ( k 4 ​ ) 2 4 − k ( − 1 ) k ⋅ x 3 ( 4 − k ) x − k = ( k 4 ​ ) 2 4 − k ( − 1 ) k ⋅ x 12 − 3 k − k = ( k 4 ​ ) 2 4 − k ( − 1 ) k ⋅ x 12 − 4 k

Set the exponent of x x x equal to zero for the constant term: 12 − 4 k = 0 ⟹ 4 k = 12 ⟹ k = 3 12 - 4k = 0 \implies 4k = 12 \implies k = 3 12 − 4 k = 0 ⟹ 4 k = 12 ⟹ k = 3

Substitute k = 3 k = 3 k = 3 into scalar terms to calculate constant value: T 4 = ( 4 3 ) 2 4 − 3 ( − 1 ) 3 = 4 ⋅ 2 1 ⋅ ( − 1 ) = 4 ⋅ 2 ⋅ ( − 1 ) = − 8 T_4 = \binom{4}{3} 2^{4-3} (-1)^3 = 4 \cdot 2^1 \cdot (-1) = 4 \cdot 2 \cdot (-1) = -8 T 4 ​ = ( 3 4 ​ ) 2 4 − 3 ( − 1 ) 3 = 4 ⋅ 2 1 ⋅ ( − 1 ) = 4 ⋅ 2 ⋅ ( − 1 ) = − 8 Conclusion: The constant term is − 8 -8 − 8 .

Loading diagram... Algorithmic Process for Binomial Expansions and Specific Term Selection