Binomial theorem — expansion, general term: Foundations

Before you can trust a single line of the parent note, you must be able to read it. This page unpacks every mark on the page, in the order they depend on each other. Nothing is assumed. If you meet a symbol later that isn't here, it was built from these.

1. What " $a$ " and " $b$ " mean here — placeholders

The picture: think of $a$ and $b$ as two labelled buckets. Whatever you pour into bucket $a$ stays $a$ everywhere on the page. This is why the theorem is so powerful — prove it once with abstract buckets, then reuse it for a thousand concrete problems.

Why the topic needs it: the whole point of the binomial theorem is a template you fill in. Without placeholders you'd re-derive everything for every new problem.

2. Exponents — "multiply by itself"

The picture: below, each factor of $a$ is one tile in a row. The exponent is simply how many tiles.

Figure — Binomial theorem — expansion, general term

Two rules we lean on constantly:

Why the topic needs them: in Example 2 of the parent, $(x^{2})^{9 - r} = x^{2 (9 - r)}$ uses the nesting rule, and combining $x^{18 - 2 r} \cdot x^{- r} = x^{18 - 3 r}$ uses the adding rule. Every "combine into a single power of $x$ " step is one of these two laws.

3. Negative exponents — powers that live "downstairs"

The picture: a positive exponent stacks tiles upstairs (numerator); a negative exponent stacks them downstairs (denominator). The number line of exponents runs through zero without a gap: $\dots, x^{2}, x^{1}, x^{0}, x^{- 1}, x^{- 2}, \dots$

Why the topic needs it: problems like $(x^{2} + \frac{1}{x})^{9}$ hide a $x^{- 1}$ inside. Rewriting $\frac{1}{x} = x^{- 1}$ lets us add exponents and land on a single power — the only form we can set equal to a target like $x^{6}$ .

4. Factorial " $!$ " — count the orderings

The picture: $n!$ counts the number of ways to arrange $n$ distinct objects in a line. Place the first object: $n$ choices. The next: $n - 1$ choices left. And so on down to $1$ . Multiply the choices — that product is $n!$ .

Why the topic needs it: the coefficient $(r n)$ is built out of factorials. No factorial, no coefficient.

See Factorials and Permutations vs Combinations for the full story of ordered counting.

5. $(r n)$ — " $n$ choose $r$ ", the counting engine

Where the formula comes from (from zero):

Line up all $r$ chosen objects in order: there are $n \cdot (n - 1) \dots (n - r + 1) = \frac{n !}{( n - r )!}$ such ordered lists.
But we don't care about order — the same $r$ objects arranged in $r!$ different orders are the same choice.
So divide by $r!$ : $(r n) = \frac{n !}{r ! ( n - r )!}$ .

The picture: below, choosing $r = 2$ brackets out of $n = 4$ to hand you a $b$ . The chosen brackets are shaded; every distinct shading is one count.

Why the topic needs it: this is the entire reason coefficients appear. See Combinations nCr for more, and Pascal's Triangle for how these numbers stack row by row.

6. The summation sign $\sum$ — "add up a pattern"

The picture: a conveyor belt. $r$ ticks $0, 1, 2, \dots, n$ ; at each tick the machine spits out one term $f (r)$ ; they all fall into one basket and get summed.

Reading the parent's line: $(a + b)^{n} = \sum_{r = 0}^{n} (r n) a^{n - r} b^{r}$ means: run $r$ from $0$ to $n$ ; each time, build the term $(r n) a^{n - r} b^{r}$ ; add them all. Since $r$ takes $n + 1$ values ( $0$ through $n$ ), there are $== n + 1 ==$ terms — this is exactly why the parent says $n + 1$ .

Why the topic needs it: it's the compact way to say "and so on for every $r$ " without writing an endless line.

7. The counter $r$ vs the term number $r + 1$

term $T$	counter $r$	exponent of $b$
$T_{1}$	$0$	$0$
$T_{2}$	$1$	$1$
$T_{3}$	$2$	$2$

Why the topic needs it: every "find the $k$ -th term" question relies on translating between the human count and the machine's $r$ . Getting this wrong is the single most common slip (see the parent's $T_{r}$ vs $T_{r + 1}$ mistake).

8. Putting the symbols in order — prerequisite map

Read it top-down: placeholders and powers come first, factorials feed $(r n)$ , exponent laws and $(r n)$ feed the summation, and everything converges on the theorem and its general term.

Equipment checklist

Cover the right-hand side; say your answer aloud before revealing.

What does the exponent in

a^{n}

physically count?

How many copies of

a

are multiplied together.

Why is

a^{0} = 1

The empty product multiplies nothing, and

1

is the value that leaves any product unchanged (and

a^{1} / a = 1

Rewrite

\frac{1}{x ^{2}}

using a negative exponent.

x^{- 2}

Combine

x^{2 (9 - r)} \cdot x^{- r}

into one power.

x^{18 - 3 r}

What does

n!

count?

The number of ways to arrange

n

distinct objects in a line.

Why is

0! = 1

There is exactly one way to arrange nothing (do nothing).

In plain words, what is

(r n)

The number of ways to choose

r

objects from

n

when order doesn't matter.

Write the formula for

(r n)

\frac{n !}{r ! ( n - r )!}

Compute

(2 5)

10

What does

\sum_{r = 0}^{n}

tell you to do?

Run

r

from

0

n

, build a term for each, and add them all.

How many terms does that produce?

n + 1

Which counter value

r

gives the

5

th term?

r = 4

(because

T_{r + 1}

, so

r + 1 = 5

Connections

Factorials — the multiply-down-to-1 machine behind $(r n)$ .
Combinations nCr — the counting engine, defined fully here.
Permutations vs Combinations — why we divide by $r!$ (order doesn't matter).
Pascal's Triangle — the coefficients stacked row by row.
Binomial theorem — expansion, general term — the parent topic these foundations feed.
Binomial Probability Distribution — the same $(r n)$ powering random experiments.
Taylor & Maclaurin Series — where powers and coefficients go infinite.