Andromeda
Note

The Binomial Theorem

Definition

The Binomial Theorem provides a direct algebraic formula for expanding powers of a binomial expression (x+a)n(x+a)^n for any non-negative integer nn. It states: (x+a)n=j=0n(nj)ajxnj(x+a)^n = \sum_{j=0}^{n} \binom{n}{j} a^j x^{n-j} Where (nj)\binom{n}{j} represents the binomial coefficient, defined as n!j!(nj)!\frac{n!}{j!(n-j)!}.

Why It Matters

It is the essential tool for calculating probabilities in any yes/no system, from flipping coins to predicting component failure rates. Without it, the math of chance would be a slow manual count rather than a predictive science.

Core Concepts

  • The Binomial Theorem (main formula) (x+a)n=j=0n(nj)ajxnj(x + a)^n = \sum_{j=0}^{n} \binom{n}{j} a^j x^{n-j}

    • How to read: “The quantity x plus a, all raised to the n, is equal to the sum from j equals zero to n of n choose j, times a to the j, times x to the power of the quantity n minus j.”
    • Meaning: The left side is repeated multiplication. The right side sums every possible way to pick the ‘a’ term exactly j times (and x the remaining n-j times), multiplied by how many distinct ways there are to make that choice.
  • Binomial coefficient (the counting engine) (nj)=n!j!(nj)!also written nCj or "n choose j"\binom{n}{j} = \frac{n!}{j! (n-j)!} \quad \text{also written } {}_nC_j \text{ or "n choose j"}

    • How to read: “The binomial coefficient n choose j is equal to n factorial divided by the product of j factorial and the quantity n minus j factorial.”
    • Meaning: Counts the number of ways to choose j items out of n where order doesn’t matter. It is the multiplier in front of each term in the expansion. Memorize that (n0)=1\binom{n}{0} = 1, (n1)=n\binom{n}{1} = n, (nn)=1\binom{n}{n} = 1, and they are symmetric.
  • General / specific term

    • The term containing aja^j (or the (j+1)(j+1)-th term) is Tj+1=(nj)xnjajT_{j+1} = \binom{n}{j} x^{n-j} a^j.
    • How to read: “The term j plus one is equal to n choose j, times x to the power of the quantity n minus j, times a to the j.”
    • Meaning: Use this when you only need one specific term (e.g., the constant term, the term with x^3, the middle term). Extremely useful in probability (binomial distribution) and when finding a particular coefficient without writing the whole expansion.
  • Pascal’s Triangle & recursive property (nj1)+(nj)=(n+1j)\binom{n}{j-1} + \binom{n}{j} = \binom{n+1}{j}

    • How to read: “The sum of n choose the quantity j minus one and n choose j is equal to n plus one choose j.”
    • Meaning: Each entry is the sum of the two entries above it. This gives a fast way to build coefficients without factorials for small n. The triangle is symmetric and the rows sum to 2^n.
  • Key expansion properties (quick checks)

    • Exactly n+1 terms.
    • In every term, the exponents on x and a always add to n.
    • Coefficients are symmetric: coefficient of a^j equals coefficient of a^{n-j}.
    • Sum of all coefficients = (1+1)^n = 2^n.

Connected Concepts