In elementary algebra, expanding binomial expressions like $(a + b)^2$ and $(a + b)^3$ is straightforward using basic algebraic identities. However, as the exponent $n$ increases to larger positive integers (e.g., $(a + b)^5$, $(a + b)^{10}$), manual expansion via repeated multiplication becomes highly tedious and error-prone. The Binomial Theorem provides a systematic, algorithmic method to expand any positive integral power of a binomial expression.
By examining the expansions of $(a + b)^n$ for small values of $n$, we can observe several fundamental structural patterns:
From these expansions, we establish three critical structural properties:
The coefficients of the expansions can be arranged in a highly symmetric triangular array known as Pascal's Triangle (historically documented as Meru Prastara by Pingala):
| Index ($n$) | Coefficients Array |
|---|---|
| 0 | 1 |
| 1 | 1 1 |
| 2 | 1 2 1 |
| 3 | 1 3 3 1 |
| 4 | 1 4 6 4 1 |
| 5 | 1 5 10 10 5 1 |
Generation Rule: Aside from the boundary elements which are always $1$, any coefficient in a given row is the sum of the two adjacent coefficients directly above it in the preceding row.
To compute expansions for very large indices without constructing the entire Pascal's Triangle, we express the coefficients using the concept of combinations: ${}^nC_r = \frac{n!}{r!(n-r)!}$ for $0 \le r \le n$.
For any positive integer $n$, the expansion of a binomial $(a + b)^n$ is given by:
$$ (a + b)^n = {}^nC_0 a^n + {}^nC_1 a^{n-1}b + {}^nC_2 a^{n-2}b^2 + \dots + {}^nC_{n-1} a b^{n-1} + {}^nC_n b^n $$Using summation notation, this is compactly written as:
$$ (a + b)^n = \sum_{k=0}^{n} {}^nC_k a^{n-k} b^k $$where the coefficients ${}^nC_r$ are called the binomial coefficients.
We prove the statement $P(n): (a + b)^n = \sum_{r=0}^{n} {}^nC_r a^{n-r}b^r$ for all $n \in \mathbb{N}$:
By substituting specific values for $a$ and $b$, we derive several highly useful special cases:
| Substitution Parameters | Resulting Expansion Formula | Key Algebraic Properties |
|---|---|---|
| $a = x$, $b = -y$ | $(x - y)^n = {}^nC_0 x^n - {}^nC_1 x^{n-1}y + {}^nC_2 x^{n-2}y^2 - \dots + (-1)^n {}^nC_n y^n$ | Terms alternate in sign starting with positive. |
| $a = 1$, $b = x$ | $(1 + x)^n = {}^nC_0 + {}^nC_1 x + {}^nC_2 x^2 + \dots + {}^nC_n x^n$ | Extremely useful for polynomial approximations. |
| $a = 1$, $b = -x$ | $(1 - x)^n = {}^nC_0 - {}^nC_1 x + {}^nC_2 x^2 - \dots + (-1)^n {}^nC_n x^n$ | Alternating series with variable $x$. |
| $a = 1$, $b = 1$ | $2^n = {}^nC_0 + {}^nC_1 + {}^nC_2 + \dots + {}^nC_n$ | The sum of all binomial coefficients of order $n$ is $2^n$. |
| $a = 1$, $b = -1$ | $0 = {}^nC_0 - {}^nC_1 + {}^nC_2 - \dots + (-1)^n {}^nC_n$ | The sum of even-indexed coefficients equals the sum of odd-indexed coefficients. |
Below are standard applications of the Binomial Theorem, demonstrating algebraic expansion, numerical evaluation, and divisibility proofs.
Mathematical Problem Statement: Expand the expression $\left(x^2 + \frac{3}{x}\right)^4$, where $x \neq 0$.
Step-by-Step Algorithmic Solution Trace:
- Identify the parameters for the binomial formula: $a = x^2$, $b = \frac{3}{x}$, and $n = 4$.
- Write down the expansion using binomial coefficients for $n = 4$: $$ \left(x^2 + \frac{3}{x}\right)^4 = {}^4C_0 (x^2)^4 + {}^4C_1 (x^2)^3\left(\frac{3}{x}\right) + {}^4C_2 (x^2)^2\left(\frac{3}{x}\right)^2 + {}^4C_3 (x^2)^1\left(\frac{3}{x}\right)^3 + {}^4C_4 \left(\frac{3}{x}\right)^4 $$
- Evaluate the binomial coefficients: ${}^4C_0 = 1$, ${}^4C_1 = 4$, ${}^4C_2 = 6$, ${}^4C_3 = 4$, ${}^4C_4 = 1$.
- Simplify each term individually:
- Term 1: $1 \cdot x^8 = x^8$
- Term 2: $4 \cdot x^6 \cdot \frac{3}{x} = 12x^5$
- Term 3: $6 \cdot x^4 \cdot \frac{9}{x^2} = 54x^2$
- Term 4: $4 \cdot x^2 \cdot \frac{27}{x^3} = \frac{108}{x}$
- Term 5: $1 \cdot \frac{81}{x^4} = \frac{81}{x^4}$
- Combine the simplified terms to form the final polynomial expression.
Final Evaluation Output:
$$ \left(x^2 + \frac{3}{x}\right)^4 = x^8 + 12x^5 + 54x^2 + \frac{108}{x} + \frac{81}{x^4} $$
Mathematical Problem Statement: Compute the exact value of $(98)^5$ using the Binomial Theorem.
Step-by-Step Algorithmic Solution Trace:
- Express the base $98$ as a difference of two numbers that are easy to compute: $98 = 100 - 2$.
- Apply the binomial expansion for $(a - b)^n$ with $a = 100$, $b = 2$, and $n = 5$: $$ (100 - 2)^5 = {}^5C_0 (100)^5 - {}^5C_1 (100)^4(2) + {}^5C_2 (100)^3(2)^2 - {}^5C_3 (100)^2(2)^3 + {}^5C_4 (100)(2)^4 - {}^5C_5 (2)^5 $$
- Substitute the binomial coefficients ($1, 5, 10, 10, 5, 1$) and compute the powers: $$ = 1(10,000,000,000) - 5(100,000,000)(2) + 10(1,000,000)(4) - 10(10,000)(8) + 5(100)(16) - 1(32) $$
- Perform the scalar multiplications: $$ = 10,000,000,000 - 1,000,000,000 + 40,000,000 - 800,000 + 8,000 - 32 $$
- Group positive and negative terms to simplify arithmetic:
- Positive terms: $10,000,000,000 + 40,000,000 + 8,000 = 10,040,008,000$
- Negative terms: $1,000,000,000 + 800,000 + 32 = 1,000,800,032$
- Subtract the sums: $10,040,008,000 - 1,000,800,032 = 9,039,207,968$.
Final Evaluation Output:
$$ (98)^5 = 9,039,207,968 $$
Mathematical Problem Statement: Prove that $6^n - 5n$ always leaves a remainder of $1$ when divided by $25$ for all positive integers $n$.
Step-by-Step Algorithmic Solution Trace:
- Express the base $6$ as $(1 + 5)$ so that powers of $5$ can be analyzed for divisibility by $25$ ($5^2$): $$ 6^n = (1 + 5)^n $$
- Expand $(1 + 5)^n$ using the binomial theorem: $$ (1 + 5)^n = {}^nC_0 + {}^nC_1(5) + {}^nC_2(5)^2 + {}^nC_3(5)^3 + \dots + {}^nC_n(5)^n $$
- Substitute the known values for the first two coefficients (${}^nC_0 = 1$, ${}^nC_1 = n$): $$ 6^n = 1 + 5n + {}^nC_2(25) + {}^nC_3(125) + \dots + {}^nC_n(5)^n $$
- Isolate the term $6^n - 5n$ on the left-hand side: $$ 6^n - 5n = 1 + 25 \left[ {}^nC_2 + 5 \cdot {}^nC_3 + \dots + 5^{n-2} \cdot {}^nC_n \right] $$
- Let $k = {}^nC_2 + 5 \cdot {}^nC_3 + \dots + 5^{n-2} \cdot {}^nC_n$. Since $n$ and all binomial coefficients are integers, $k$ is a non-negative integer: $$ 6^n - 5n = 25k + 1 $$
- By definition of Euclidean division, this shows that $6^n - 5n$ divided by $25$ yields a quotient of $k$ and a remainder of $1$.
Final Evaluation Output:
$$ 6^n - 5n \equiv 1 \pmod{25} \quad \blacksquare $$
Historical Chronicle: Evolution of Binomial Coefficients