Binomial Expansion Calculator
Expand (a + b)ⁿ using the Binomial Theorem. Enter values for a, b, and the exponent n to get the complete polynomial expansion instantly.
The Binomial Theorem Explained
The Binomial Theorem gives a formula for expanding (a + b)ⁿ without multiplying the binomial by itself n times. The expansion has n+1 terms, each combining powers of a and b with a binomial coefficient. The kth term (starting from k=0) is C(n,k)·aⁿ⁻ᵏ·bᵏ, where C(n,k) = n!/(k!(n-k)!).
Notice the pattern: powers of a decrease from n to 0, while powers of b increase from 0 to n. The exponents in each term sum to n. The coefficients follow Pascal's triangle—for (a+b)³, the coefficients are 1, 3, 3, 1 (row 3 of the triangle), giving 1·a³ + 3·a²b + 3·ab² + 1·b³.
This theorem is powerful because it converts a multiplication problem into a summation formula. Instead of computing (a+b)(a+b)(a+b)..., you directly write down the terms using the coefficients and exponent rules. This saves enormous amounts of work, especially for large n.
Computing Binomial Coefficients
Binomial coefficients C(n,k) count combinations and appear throughout mathematics. The formula n!/(k!(n-k)!) looks intimidating, but it simplifies with cancellation. For C(5,2), you get 5!/(2!·3!) = (5·4·3·2·1)/((2·1)·(3·2·1)) = (5·4)/(2·1) = 10 after canceling the 3! in numerator and denominator.
Pascal's triangle offers a faster way: start with row 0 containing just 1. Each new row begins and ends with 1, and interior entries equal the sum of the two entries above. Row 4 is [1, 4, 6, 4, 1], giving the coefficients for (a+b)⁴. This recursive structure makes it easy to generate coefficients for small exponents by hand.
For large n, calculating factorials directly risks overflow in computer arithmetic. Many implementations use dynamic programming or logarithms to compute coefficients stably. Understanding both the factorial formula and Pascal's recursive property helps you choose the best method for your situation.
Applications of Binomial Expansion
Probability theory relies heavily on binomial expansion. The binomial distribution, which models the number of successes in n independent trials, uses binomial coefficients to compute probabilities. Each term C(n,k)·pᵏ·(1-p)ⁿ⁻ᵏ represents the probability of exactly k successes, directly mirroring the binomial expansion structure.
In calculus and numerical analysis, binomial expansion enables polynomial approximations of more complicated functions. The approximation (1+x)ⁿ ≈ 1 + nx for small x comes from truncating the binomial expansion after the linear term. Engineers use this for quick estimates of growth rates, error propagation, and sensitivity analysis.
Algebraic manipulation benefits too. Expanding (x+1)⁵ by the theorem is faster than repeated FOIL. Factoring sometimes requires recognizing binomial patterns in reverse. And in competition mathematics, binomial identities—like C(n,k) = C(n,n-k) or the sum Σ C(n,k) = 2ⁿ—solve counting problems and simplify expressions that would be intractable without the theorem's structure.
Frequently Asked Questions
What is the Binomial Theorem?
The Binomial Theorem provides a formula to expand (a + b)ⁿ into a sum of terms. Each term has the form C(n,k)·aⁿ⁻ᵏ·bᵏ, where C(n,k) is a binomial coefficient from Pascal's triangle.
How do you calculate binomial coefficients?
Binomial coefficients C(n,k) = n! / (k!(n-k)!) count the number of ways to choose k items from n. They also appear as entries in Pascal's triangle: row n, position k.
What is Pascal's triangle?
Pascal's triangle is a triangular array where each number equals the sum of the two numbers above it. Row n contains the binomial coefficients for (a+b)ⁿ. Row 0 is 1, row 1 is 1 1, row 2 is 1 2 1, row 3 is 1 3 3 1, and so on.
Can I expand binomials with negative exponents?
The standard Binomial Theorem applies to non-negative integer exponents. For negative or fractional exponents, you need the generalized binomial theorem, which produces infinite series rather than finite polynomials.
How is binomial expansion used in real life?
Binomial expansion appears in probability (binomial distributions), finance (compound interest approximations), physics (approximating functions), and computer science (algorithm analysis). It's a fundamental tool for polynomial approximation.