Binomial Expansion
The Binomial Theorem is one of the most powerful tools in algebra, allowing us to expand expressions of the form (a + b)^n without performing repeated multiplication. Instead of laboriously multiplying (a + b) by itself n times, the theorem provides a direct formula that gives every term in the expansion immediately. This saves enormous effort, especially when n is large, and reveals deep patterns in algebra and combinatorics. The theorem states that (a + b)^n can be written as a sum of terms, each involving a binomial coefficient, a power of a, and a power of b. The binomial coefficients — the numbers that appear in Pascal's Triangle — tell us exactly how many ways each combination of a's and b's can arise. This connection between algebra and counting is one of the beautiful unifying ideas in mathematics. Binomial expansions appear throughout mathematics and its applications: in probability theory when calculating combinations of outcomes, in calculus when approximating functions, in statistics with the binomial distribution, and in physics when expanding expressions for small perturbations. Mastering the general term formula lets you find any specific term in an expansion without writing out all the others.
- Pascal's Triangle and Binomial Coefficients
- The Full Binomial Expansion Formula
- The General Term (T_{r+1})
- Finding a Specific Term by Setting Up an Equation
- Key Properties of the Expansion
Pascal's Triangle and Binomial Coefficients
Before stating the theorem, we need binomial coefficients. The binomial coefficient C(n, r), also written \binom{n}{r} or ^nC_r, counts the number of ways to choose r items from n distinct items. It is defined as \binom{n}{r} = \frac{n!}{r!(n-r)!}. For example, \binom{4}{2} = \frac{4!}{2! \cdot 2!} = 6. These coefficients form the rows of Pascal's Triangle, where row n lists \binom{n}{0}, \binom{n}{1}, \ldots, \binom{n}{n}. Each entry equals the sum of the two entries directly above it.
The Full Binomial Expansion Formula
The Binomial Theorem states: (a + b)^n = \sum_{r=0}^{n} \binom{n}{r} a^{n-r} b^r. Expanding this sum explicitly: (a+b)^n = \binom{n}{0}a^n + \binom{n}{1}a^{n-1}b + \binom{n}{2}a^{n-2}b^2 + \cdots + \binom{n}{n}b^n. Notice that there are always n+1 terms in the expansion. The powers of a decrease from n to 0, while the powers of b increase from 0 to n, and in every term the total power of a and b always adds up to n.
The General Term (T_{r+1})
The most useful formula for problem-solving is the General Term, which gives any specific term without expanding everything. The (r+1)-th term is: T_{r+1} = \binom{n}{r} a^{n-r} b^r, where r = 0, 1, 2, \ldots, n. For example, in (x + 2)^7, the 4th term (r = 3) is T_4 = \binom{7}{3} x^{7-3} (2)^3 = 35 \cdot x^4 \cdot 8 = 280x^4. The general term is especially powerful for finding a specific term, like 'the term containing x^5' or 'the constant term', without writing the full expansion.
Finding a Specific Term by Setting Up an Equation
When asked for 'the term containing x^k' in the expansion of (ax + b)^n, write the general term T_{r+1} = \binom{n}{r}(ax)^{n-r}(b)^r = \binom{n}{r}a^{n-r}b^r x^{n-r}. Then set the exponent of x equal to k: n - r = k, giving r = n - k. Substitute this value of r back into the general term formula to find the coefficient. For the constant term, set n - r = 0 so r = n (if b contains no x). This technique works even for expressions like (x + 1/x)^n or (x^2 - 3x)^n.
Key Properties of the Expansion
Several important properties follow from the Binomial Theorem. First, setting a = b = 1 gives 2^n = \sum_{r=0}^{n}\binom{n}{r}, meaning all the binomial coefficients in row n of Pascal's Triangle add up to 2^n. Setting a = 1, b = -1 gives 0 = \sum_{r=0}^{n}(-1)^r\binom{n}{r}, so the alternating sum of binomial coefficients is zero. The middle term of the expansion of (a+b)^n occurs at r = n/2 when n is even, or there are two middle terms at r = (n-1)/2 and r = (n+1)/2 when n is odd.
The Key Equation
- T_{r+1} — General Term (dimensionless): The (r+1)-th term in the binomial expansion of (a+b)^n, counting from r=0.
- \binom{n}{r} — Binomial Coefficient (dimensionless): Equals n! divided by r!(n-r)!; counts the number of ways to select r objects from n. Also denoted ^nC_r.
- n — Exponent / Index (dimensionless): A non-negative integer; the power to which the binomial (a+b) is raised. It also equals the number of terms minus one.
- r — Term Index (dimensionless): An integer ranging from 0 to n. Each value of r gives one distinct term in the expansion.
- a,\, b — First and Second Terms of Binomial (dimensionless): The two parts of the binomial expression. Can be constants, variables, or algebraic expressions.
Worked Example
Problem. Expand (2x - 3)^4 fully using the Binomial Theorem, and then identify the term independent of x in the expansion of \left(x + \dfrac{2}{x}\right)^6.
Answer. Expansion: 16x^4 - 96x^3 + 216x^2 - 216x + 81; Constant term: 160
Origins · 1 minBlaise Pascal and how this was discovered
Although the triangle of binomial coefficients had been studied centuries earlier by Chinese mathematician Yang Hui and Persian mathematician Al-Karaji, Pascal systematically investigated its properties in his 1654 work Traité du triangle arithmétique. He showed how the triangle generates binomial coefficients and applied it to probability theory, combinatorics, and the binomial expansion — making his name synonymous with the triangle worldwide. Pascal built one of the world's first mechanical calculators, called the Pascaline, at age 18 to help his father — a tax collector — with tedious arithmetic. He invented it not for fame, but simply to reduce his father's workload.
Related Concepts
- Binomial Coefficients and Pascal's Triangle — Binomial coefficients are the building blocks of every term in the expansion; understanding how to compute \binom{n}{r} is essential for applying the theorem.
- Geometric Series — The sum of a geometric series can be derived using binomial-type factoring, and both topics fall within the Sequences and Series unit.
- Combinations and Permutations — The formula \binom{n}{r} = \frac{n!}{r!(n-r)!} comes directly from combinatorics; understanding combinations deepens insight into why binomial coefficients count what they count.
- Binomial Distribution (Probability) — The probability of exactly r successes in n independent trials is P(X=r) = \binom{n}{r}p^r(1-p)^{n-r}, which is precisely one term of a binomial expansion with a = p and b = 1-p.
- Binomial Approximation for Small Values — When |x| \ll 1, the expansion (1+x)^n \approx 1 + nx is used widely in physics and engineering; this is a direct application of the first two terms of the binomial expansion.