Binomial Theorem & Expansion Calculator

Binomial Theorem Guide

What's the key thing to understand about The Binomial Theorem?

(a + b)ⁿ = Σ C(n,r) × aⁿ⁻ʳ × bʳ for r from 0 to n. The (r+1)-th term (or term in xʳ): T_{r+1} = C(n,r) × aⁿ⁻ʳ × (bx)ʳ. Binomial coefficient C(n,r) = n! / (r!(n−r)!) = nCr. Example: (1+x)⁴. r=0: C(4,0)×1⁴×x⁰ = 1. r=1: C(4,1)×1³×x = 4x. r=2: C(4,2)×1²×x² = 6x². r=3: C(4,3)×1×x³ = 4x³. r=4: C(4,4)×x⁴ = x⁴. Expansion: 1 + 4x + 6x² + 4x³ + x⁴.

What do I need to know about Pascal's Triangle?

The binomial coefficients for each power n form rows of Pascal's triangle. 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. Each entry = sum of two entries directly above. The r-th entry in row n = C(n,r) = nCr. Row sum: sum of row n = 2ⁿ (the total number of subsets of n items). Alternating sum: 0 for n > 0. The binomial coefficients appear in probability distributions, algebra, and combinatorics.

What do I need to know about Binomial Approximation?

For small |x| (|x| << 1): (1 + x)ⁿ ≈ 1 + nx. More precise: (1 + x)ⁿ ≈ 1 + nx + n(n−1)x²/2 + .... This works for any n (positive, negative, fractional). Example: (1.02)⁵ ≈ 1 + 5×0.02 = 1.10. Exact: 1.1041. Error: 0.37%. Very useful for: compound interest approximations. Relativistic mechanics (γ ≈ 1 + v²/2c²). Error propagation in physics. Fractional powers: (1 + x)^(1/2) ≈ 1 + x/2 − x²/8. (1 + x)^(−1) ≈ 1 − x + x² − x³... (geometric series).

What's the key thing to understand about Negative and Fractional Powers?

The binomial theorem extends to non-integer n for |x| < 1: (1 + x)ⁿ = 1 + nx + n(n−1)x²/2! + n(n−1)(n−2)x³/3! + ... For negative n, this gives an infinite series (converges for |x| < 1). Example: (1 + x)^(−1) = 1 − x + x² − x³ + ... (geometric series with ratio −x). (1 − x)^(−1) = 1 + x + x² + x³ + ... This is how engineers and physicists quickly approximate complicated expressions — replace with the first few terms of the binomial expansion.

What should I know about Finding a Specific Term?

You rarely need every term of an expansion — often you just need, say, the term containing x⁵. The general (r+1)th term of (a+b)ⁿ is given by T(r+1) = C(n,r) × a^(n−r) × b^r, where r starts at 0. For (2x+3)⁷, to find the term in x⁴: since a=2x contributes x^(n−r), you need n−r=4, i.e. r=3 (since n=7). That term is C(7,3) × (2x)^4 × 3³ = 35 × 16x⁴ × 27 = 15120x⁴. This shortcut avoids expanding all eight terms and is exactly the kind of question set in A-Level and IB exams: 'find the coefficient of x^k in the expansion of...'. The key is matching the power of x you want to the exponent pattern (a)^(n−r)(b)^r before computing the binomial coefficient and the numeric parts separately.

What do I need to know about Sum of Binomial Coefficients?

Setting a=1 and b=1 in (a+b)ⁿ = Σ C(n,r) gives a neat identity: the sum of all coefficients in row n of Pascal's triangle equals 2ⁿ. For n=4: C(4,0)+C(4,1)+C(4,2)+C(4,3)+C(4,4) = 1+4+6+4+1 = 16 = 2⁴. This is why each row of Pascal's triangle sums to a power of 2, and it has a direct combinatorial meaning: 2ⁿ is the total number of subsets of an n-element set, and C(n,r) counts exactly how many of those subsets have size r. Setting a=1, b=−1 instead gives an alternating sum that equals zero for n>0 — a useful check that the coefficients in any row are correctly computed, since C(n,0)−C(n,1)+C(n,2)−... must cancel out exactly.

What's the key thing to understand about the Binomial Theorem's Connection to the Binomial Distribution?

The binomial theorem's coefficients, (n choose k), are exactly the same numbers that appear in the binomial probability distribution, which is no coincidence — both describe the number of ways to arrange k successes among n trials. Expanding (p + q)ⁿ, where p is the probability of success and q = 1-p is the probability of failure, gives every term of the binomial probability formula at once: each term (n choose k)pᵏ q^(n-k) is exactly the probability of getting k successes in n trials. Since p + q = 1, the full expansion (p+q)ⁿ = 1 confirms that the probabilities of every possible outcome (0 successes, 1 success, ..., n successes) sum to exactly 1, as any valid probability distribution must. This link is why the binomial theorem is taught alongside probability as well as algebra.

What should I know about Multinomial Expansions Beyond Two Terms?

The binomial theorem expands powers of a sum of exactly two terms, (a+b)^n, but the same underlying idea extends to sums of three or more terms through the multinomial theorem. For a trinomial (a+b+c)^n, the expansion consists of terms of the form [n!/(i!j!k!)] × a^i × b^j × c^k, summed over every combination of non-negative integers i, j, k that add up to n, where the coefficient n!/(i!j!k!) is called a multinomial coefficient and generalises the binomial coefficient n!/(i!(n−i)!) to three or more parts. For example, expanding (a+b+c)² gives a² + b² + c² + 2ab + 2ac + 2bc, where the coefficient 2 on each cross term comes from 2!/(1!1!0!) = 2. Just as the binomial coefficients in (a+b)^n sum to 2^n (found by setting a = b = 1), the multinomial coefficients of (a+b+c)^n sum to 3^n, and more generally the coefficients of a k-term multinomial expansion raised to the power n sum to k^n. The multinomial theorem appears throughout probability theory, particularly in the multinomial distribution, which generalises the binomial distribution to experiments with more than two possible outcomes per trial, such as rolling a six-sided die repeatedly rather than flipping a two-sided coin.

What should I know about Quick-Reference Binomial Coefficients?

Binomial coefficients C(n,r) = n!/(r!(n−r)!) come up so often that a quick-reference table for common values saves recalculating factorials from scratch:

Notice the symmetry C(n,r) = C(n,n−r) — C(10,5) is its own mirror image, while C(9,4)=126 also equals C(9,5), since choosing which 4 of 9 items to include is equivalent to choosing which 5 to leave out.

What should I know about a Worked Example: Full Expansion of (2x − 1)^5?

As a fully worked expansion, consider (2x − 1)⁵, which combines a non-trivial coefficient on x with a negative second term. Using (a+b)⁵ = Σ C(5,r) a⁵⁻ʳ bʳ with a=2x and b=−1: r=0 gives C(5,0)(2x)⁵(−1)⁰ = 1×32x⁵ = 32x⁵. r=1 gives C(5,1)(2x)⁴(−1)¹ = 5×16x⁴×(−1) = −80x⁴. r=2 gives C(5,2)(2x)³(−1)² = 10×8x³×1 = 80x³. r=3 gives C(5,3)(2x)²(−1)³ = 10×4x²×(−1) = −40x². r=4 gives C(5,4)(2x)¹(−1)⁴ = 5×2x×1 = 10x. r=5 gives C(5,5)(2x)⁰(−1)⁵ = 1×1×(−1) = −1. Combining all six terms: (2x−1)⁵ = 32x⁵ − 80x⁴ + 80x³ − 40x² + 10x − 1. A quick check: substituting x=1 should give (2−1)⁵=1⁵=1, and indeed 32−80+80−40+10−1 = 1, confirming the expansion is correct.

What should I know about Binomial Coefficients and Counting Problems?

Beyond algebra, binomial coefficients directly answer combinatorics questions about how many ways a selection can be made, since C(n,r) literally counts the number of ways to choose r items from n distinct items when order doesn't matter. For example, 'in how many ways can a committee of 4 people be chosen from a pool of 10 candidates?' is exactly C(10,4) = 10!/(4!×6!) = 210. This is the same calculation, and the same number, that appears as the coefficient of a⁶b⁴ in the expansion of (a+b)¹⁰ — because choosing which 4 of the 10 factors contribute a 'b' (and which 6 contribute an 'a') is precisely the committee-selection problem in disguise. This dual identity — C(n,r) as an algebraic coefficient and as a combinatorial count — is why Pascal's triangle appears equally in algebra textbooks and in probability and counting problems, and why mastering one use of binomial coefficients transfers directly to the other.

What should I know about Approximating Square Roots with the Binomial Series?

The binomial approximation also handles square roots efficiently, since √(1+x) = (1+x)^(1/2) ≈ 1 + x/2 − x²/8 for small x. Estimating √1.05 this way: x=0.05, so √1.05 ≈ 1+0.025−0.0003125 = 1.0246875, matching the true value of 1.024695 to four decimal places — useful for quick mental estimates of square roots close to a perfect square without needing a calculator's root function at all.