Sign in to save

Bookmark this page so you can find it later.

Sign in to save

Bookmark this page so you can find it later.

The binomial theorem gives a fast way to expand powers of binomials like (a+b)n(a + b)^n without multiplying many factors by hand. This cheat sheet helps students recognize the pattern of terms, exponents, and coefficients in a binomial expansion. It is especially useful for algebra, precalculus, probability, and series topics where binomial coefficients appear often.

The main formula is (a+b)n=k=0n(nk)ankbk(a + b)^n = \sum_{k=0}^{n} \binom{n}{k}a^{n-k}b^k. The coefficient (nk)\binom{n}{k} counts how many ways to choose kk items from nn items and can be found using (nk)=n!k!(nk)!\binom{n}{k}=\frac{n!}{k!(n-k)!}. In each term, the exponent on aa decreases while the exponent on bb increases, and the exponents always add to nn.

Pascal's triangle provides the same coefficients for small powers.

Key Facts

  • The binomial theorem states that (a+b)n=k=0n(nk)ankbk(a + b)^n = \sum_{k=0}^{n} \binom{n}{k}a^{n-k}b^k for any nonnegative integer nn.
  • The binomial coefficient is (nk)=n!k!(nk)!\binom{n}{k}=\frac{n!}{k!(n-k)!}, where 0kn0 \le k \le n.
  • The general term of (a+b)n(a + b)^n is Tk+1=(nk)ankbkT_{k+1}=\binom{n}{k}a^{n-k}b^k because the first term occurs when k=0k=0.
  • In the expansion of (a+b)n(a + b)^n, there are n+1n+1 terms before combining any like terms.
  • For each term in (a+b)n(a + b)^n, the exponents add to nn, so ankbka^{n-k}b^k has total degree nn.
  • The coefficients in (a+b)n(a + b)^n match row nn of Pascal's triangle when the top row is row 00.
  • For subtraction, (ab)n=k=0n(nk)ank(b)k(a - b)^n = \sum_{k=0}^{n} \binom{n}{k}a^{n-k}(-b)^k, so signs alternate when bb is positive.
  • The symmetry rule (nk)=(nnk)\binom{n}{k}=\binom{n}{n-k} means matching coefficients from opposite ends of the expansion are equal.

Vocabulary

Binomial
A binomial is an algebraic expression with two terms, such as a+ba+b or x3x-3.
Binomial theorem
The binomial theorem is the formula (a+b)n=k=0n(nk)ankbk(a + b)^n = \sum_{k=0}^{n} \binom{n}{k}a^{n-k}b^k for expanding a binomial raised to a nonnegative integer power.
Binomial coefficient
A binomial coefficient (nk)\binom{n}{k} is the number that multiplies a term in a binomial expansion and equals n!k!(nk)!\frac{n!}{k!(n-k)!}.
Factorial
A factorial n!n! is the product of all positive integers from 11 to nn, with 0!=10! = 1.
General term
The general term is a formula such as Tk+1=(nk)ankbkT_{k+1}=\binom{n}{k}a^{n-k}b^k that describes any term in an expansion.
Pascal's triangle
Pascal's triangle is a triangular arrangement of numbers where each interior number is the sum of the two numbers above it.

Common Mistakes to Avoid

  • Forgetting the coefficients is wrong because (a+b)n(a+b)^n is not found by raising each term separately; for example, (a+b)2=a2+2ab+b2(a+b)^2=a^2+2ab+b^2, not a2+b2a^2+b^2.
  • Using kk as the term number directly is wrong because the general term Tk+1=(nk)ankbkT_{k+1}=\binom{n}{k}a^{n-k}b^k starts with k=0k=0, so the first term is T1T_1.
  • Dropping the negative sign in (ab)n(a-b)^n is wrong because the second term is b-b, so (b)k(-b)^k controls whether each term is positive or negative.
  • Letting exponents add to more or less than nn is wrong because every term in (a+b)n(a+b)^n must have the form ankbka^{n-k}b^k, so the total exponent is always nn.
  • Using the wrong row of Pascal's triangle is wrong because (a+b)n(a+b)^n uses row nn when the top row 11 is counted as row 00.

Practice Questions

  1. 1 Expand (x+2)5(x+2)^5 using the binomial theorem.
  2. 2 Find the coefficient of x4x^4 in the expansion of (3x1)6(3x-1)^6.
  3. 3 Find the third term in the expansion of (2a+b)7(2a+b)^7.
  4. 4 Explain why the coefficients of (a+b)8(a+b)^8 are symmetric from left to right.

Understanding Binomial Theorem Reference

The coefficients come from choices made during multiplication. Imagine several identical brackets, each containing two terms. To build one final term, you choose one term from every bracket.

A term containing the second item three times can be formed in many different choice orders. Those orders combine into one coefficient. This is why the numbers are counting numbers, not random values to memorize.

Factorials give a compact way to count the possible orders. The same counting idea appears in combinations, where order does not matter, such as selecting a committee or choosing winning lottery positions.

For a particular coefficient, first identify every possible way the needed power can occur. For example, when finding the coefficient of a power of x in a binomial involving x and a constant, the power of x tells you how many times x must be selected from the brackets. The remaining selections must be constants.

Then include the number of such selections and any numerical factors carried by the chosen terms. This method is safer than expanding the whole expression when only one coefficient is needed. It is especially useful in exam questions with high powers, where writing every term wastes time and increases the chance of an arithmetic error.

Subtraction needs careful handling because the negative sign belongs to the entire second term. Each time that negative term is chosen, it contributes one negative factor. An even number of negative factors produces a positive result.

An odd number produces a negative result. Students often lose signs by treating the negative value separately from its power. Put the second term in brackets mentally before working.

This same habit matters when the terms include fractions, decimals, or expressions such as two x minus three. A coefficient can be negative, and it can include powers of ordinary numbers.

Binomial coefficients matter beyond algebra because they describe repeated yes or no outcomes. In probability, they count the arrangements with a fixed number of successes in repeated trials. A model for coin tosses uses the same coefficients because getting three heads in five tosses can happen in several orders.

The other factors in the probability calculation give the chance of each order. When checking an expansion, use simple tests. The first coefficient and last coefficient should be one before any extra numerical factors are included.

Matching positions from the ends should agree in size. Setting one variable to zero checks the end term.

Setting both variables to one checks whether the coefficients add to the value of two raised to the given power. These checks catch many small mistakes quickly.