Binomial Expansion for Advanced Mathematics

Updated July 2026

Mastering the expansion of (1+x)n(1 + x)^n and (a+f(x))n(a + f(x))^n for positive integers is a core requirement for the ESAT. This page explains how to use the binomial theorem to find specific coefficients, understand the notation for combinations and factorials, and apply efficient shortcuts instead of manual expansion.

Core concept

The binomial theorem states that for a positive integer nn, the expansion of (a+b)n(a + b)^n is given by k=0n(nk)ankbk\sum_{k=0}^{n} \binom{n}{k} a^{n-k} b^k, where the coefficients (nk)\binom{n}{k} are defined by n!k!(nk)!\frac{n!}{k!(n-k)!}.

The binomial theorem is a powerful mathematical tool. For the ESAT, you must be able to calculate values of (nr)\binom{n}{r} and determine any specific term in expressions of the form (1+x)n(1 + x)^n or (a+f(x))n(a + f(x))^n. For example, you might be asked to find the constant term in the expansion of (1x23x3)10(\frac{1}{x^2} - 3x^3)^{10}. While Pascal's triangle is useful for small values of nn, it becomes inefficient for larger powers such as n=17n=17. In such cases, using the binomial expansion formula directly is far more effective.

The Binomial Expansion Formula

The expansion can be written in full as:

(a+f(x))n=k=0n(nk)ak[f(x)]nk(a + f(x))^n = \sum_{k=0}^{n} \binom{n}{k} a^k [f(x)]^{n-k}

Note that an alternative form is (a+f(x))n=k=0n(nk)ank[f(x)]k(a + f(x))^n = \sum_{k=0}^{n} \binom{n}{k} a^{n-k} [f(x)]^k. Both versions are identical in result because of the symmetry of the coefficients. When using this formula, focus on the following patterns:

  1. The powers of the two terms in any given part of the expansion always add up to the total power nn.
  2. The value nn at the top of the (nr)\binom{n}{r} notation is always the power to which the bracket is raised.
  3. The value rr at the bottom can be either of the powers appearing in that specific term.

Example 1: Finding a Specific Term

Find the term with x7x^7 in the expansion of (3+2x)8(3 + 2x)^8.

To build this term, we follow three steps:

First, since we need x7x^7, we identify the part of the expression involving xx. This is (2x)(2x), which must be raised to the power of 7. It is vital to remember the brackets: (2x)7(2x)^7. This ensures both the coefficient 2 and the variable xx are raised to the power.

Second, we determine the power for the other term, 3. Since the sum of the powers must be 8, and we already have a power of 7, the power of 3 must be 87=18 - 7 = 1. Thus, we have 31(2x)73^1(2x)^7.

Third, we apply the combination coefficient (nr)\binom{n}{r}. Here n=8n=8. For rr, we can use either the power of the first term (1) or the power of the second term (7). Both (81)\binom{8}{1} and (87)\binom{8}{7} give the same value. The final expression for the term is:

(81)31(2x)7\binom{8}{1} 3^1(2x)^7

Example 2: Handling Negative Terms

Find the coefficient of x5x^5 in (23x)7(2 - 3x)^7.

A common mistake is to ignore the negative sign. We must treat the second term as (3x)(-3x). Following our rules, for x5x^5, we need (3x)5(-3x)^5. The power for the term 2 must be 75=27 - 5 = 2. The coefficient is (75)\binom{7}{5}.

The correct term is (75)22(3x)5\binom{7}{5} 2^2(-3x)^5. Expanding this gives (75)22(3)5x5\binom{7}{5} 2^2 (-3)^5 x^5. The coefficient is the numerical part of this result.

How the Binomial Expansion Works

To understand why these coefficients appear, consider the logic of combinations. If you have five letters A, B, C, D, and E, and you want to choose a collection of 3 without regard for order, you are calculating '5 choose 3'.

Initially, you have 5 choices for the first box, 4 for the second, and 3 for the third, giving 5×4×3=605 \times 4 \times 3 = 60 ways. However, this counts different orders of the same letters (like ABC and CBA) as distinct. Since there are 3!=3×2×1=63! = 3 \times 2 \times 1 = 6 ways to order any 3 letters, we divide 60 by 6 to get 10 unique collections. This is 5×4×33×2×1=5!3!2!=(53)\frac{5 \times 4 \times 3}{3 \times 2 \times 1} = \frac{5!}{3!2!} = \binom{5}{3}.

In the general case, to choose rr objects from nn, we fill rr boxes and leave nrn-r empty.

img-16.jpeg

The number of ways to arrange the objects is n!(nr)!r!\frac{n!}{(n-r)!r!}. This explains the symmetry (nr)=(nnr)\binom{n}{r} = \binom{n}{n-r}: choosing rr objects to keep is the same as choosing nrn-r objects to discard.

When expanding (2+3x)5(2 + 3x)^5, we are effectively multiplying five brackets: (2+3x)(2+3x)(2+3x)(2+3x)(2+3x)(2 + 3x)(2 + 3x)(2 + 3x)(2 + 3x)(2 + 3x). To get the x2x^2 term, we must choose the (3x)(3x) term from 2 brackets and the 2 from the remaining 3 brackets. The number of ways to choose which 2 brackets provide the (3x)(3x) is (52)\binom{5}{2}, leading to the term (52)23(3x)2\binom{5}{2} 2^3 (3x)^2.

Key takeaways

  • The sum of the powers of the terms in any part of a binomial expansion must equal the total power nn.
  • Always use brackets when raising terms like 3x-3x or 2x2x to a power to ensure the coefficient is also raised to that power.
  • The combination formula is (nr)=n!r!(nr)!\binom{n}{r} = \frac{n!}{r!(n-r)!}, which exhibits symmetry such that (nr)=(nnr)\binom{n}{r} = \binom{n}{n-r}.
  • Factorial notation n!n! represents the product of all integers from 1 up to nn, with 0!0! defined as 1.
Tips

When faced with an expression like (a+f(x))n(a + f(x))^n, always write out the general term (nr)anr[f(x)]r\binom{n}{r} a^{n-r} [f(x)]^r first. This helps you identify exactly which value of rr you need to satisfy the power of xx requested in the question.

Cautions

The most common mistake is forgetting to raise the constant part of f(x)f(x) to the required power. In (2x)7(2x)^7, the coefficient is 27=1282^7 = 128, not 2. Similarly, always include the negative sign within the bracket, as (3)5(-3)^5 is negative while (3)4(-3)^4 is positive.

Insight

The link between the binomial theorem and combinations is a fundamental part of discrete mathematics. Every term in the expansion represents a specific way of 'picking' components from a set of brackets, which is why binomial coefficients are also called 'combinatorial coefficients'.

Frequently asked questions

Why can I use either (nr)\binom{n}{r} or (nnr)\binom{n}{n-r} for the same term?

This is due to the symmetry of the binomial coefficients. Choosing rr instances of bb from nn brackets automatically means you are choosing nrn-r instances of aa from the remaining brackets. Mathematically, n!r!(nr)!\frac{n!}{r!(n-r)!} is identical to n!(nr)!r!\frac{n!}{(n-r)!r!}.

What does the term 'coefficient' refer to in these questions?

The coefficient is the numerical value that multiplies the variable part of the term. For example, in the term 240x3240x^3, the coefficient is 240. If a question asks for the coefficient, do not include the xx power in your final answer.

How do I find the constant term in an expansion like (x+1x)n(x + \frac{1}{x})^n?

The constant term is the term where the power of xx is zero. You can find this by writing the general term (nr)xr(x1)nr\binom{n}{r} x^r (x^{-1})^{n-r} and solving for rr such that the total exponent r(nr)=0r - (n - r) = 0.

Is Pascal's triangle ever better than the formula?

Pascal's triangle is often faster for very small powers, such as n=3n=3 or n=4n=4, where you can quickly write out the rows. However, for any nn greater than 6 or 7, or for questions asking for a specific term deep in an expansion, the binomial formula is much more reliable and less prone to addition errors.

Ready to test your knowledge?

You've reached the end of this section. Start a practice session to solidify your understanding and master this topic.