2.7.12Statistics & Probability — Intermediate

Binomial theorem — expansion, general term

1,571 words7 min readdifficulty · medium6 backlinks

WHAT is the binomial theorem?

  • There are exactly ==n+1====n+1== terms.
  • Powers of aa decrease n0n \to 0; powers of bb increase 0n0 \to n; each term's exponents sum to ==n====n==.
  • The coefficients (n0),(n1),,(nn)\binom{n}{0},\binom{n}{1},\dots,\binom{n}{n} form the nn-th row of Pascal's triangle.

WHY does it look like this? (Derivation from scratch)

Write the product without collapsing anything: (a+b)n=(a+b)(a+b)(a+b)n brackets(a+b)^n = \underbrace{(a+b)(a+b)\cdots(a+b)}_{n \text{ brackets}}

To expand, we choose one letter from each bracket and multiply them. A generic term is a product of nn letters.

Question: how many of these products equal anrbra^{n-r}b^{r}?

That happens when we pick bb from exactly rr brackets and aa from the other nrn-r. The number of ways to choose which rr brackets give bb is (nr)\binom{n}{r}.

Summing over all possible rr (from 00 to nn) gives the theorem. No formula was memorised — it fell out of counting.

Figure — Binomial theorem — expansion, general term

HOW to use it: the general term

This single formula answers almost every exam question:

  • Find a specific term: plug in that rr.
  • Find the term containing xkx^k: set up the exponent of xx equal to kk, solve for rr.
  • Find the term independent of xx (constant term): set the exponent of xx equal to 00.
  • Find the coefficient: compute (nr)×\binom{n}{r}\times(numeric part).

WORKED EXAMPLES


COMMON MISTAKES (steel-manned)


Active recall

Recall Predict before revealing (Forecast-then-Verify)
  1. How many terms in (a+b)12(a+b)^{12}? → 1313.
  2. In (x1x)10(x-\frac1x)^{10}, which rr gives the constant term? Set 102r=0r=510-2r=0\Rightarrow r=5.
  3. Coefficient of x3x^3 in (1+2x)5(1+2x)^5? (53)23=108=80\binom{5}{3}2^3=10\cdot8=80.
What is the binomial expansion of (a+b)n(a+b)^n?
r=0n(nr)anrbr\sum_{r=0}^{n}\binom{n}{r}a^{n-r}b^{r}
Why does (nr)\binom{n}{r} appear as a coefficient?
It counts the number of brackets from which we choose bb (the rest give aa), all producing the same anrbra^{n-r}b^r term.
How many terms are in (a+b)n(a+b)^n?
n+1n+1.
Write the general term of (a+b)n(a+b)^n.
Tr+1=(nr)anrbrT_{r+1}=\binom{n}{r}a^{n-r}b^{r}, r=0,1,,nr=0,1,\dots,n.
Why is it Tr+1T_{r+1} and not TrT_r?
Because the counter rr starts at 00; T1T_1 is r=0r=0, so the subscript is one ahead.
How do you find the term containing xkx^k?
Write Tr+1T_{r+1} as a single power of xx, set its exponent =k=k, solve for rr.
How do you find the term independent of xx?
Set the exponent of xx in Tr+1T_{r+1} equal to 00 and solve for rr.
Coefficient of xrx^r in (1+x)n(1+x)^n?
(nr)\binom{n}{r}.
Middle term of (1+x)n(1+x)^n when nn is even?
The single term Tn/2+1=(nn/2)xn/2T_{n/2+1}=\binom{n}{n/2}x^{n/2}.
In (2x3)n(2x-3)^n, is the coefficient just (nr)\binom{n}{r}?
No — include numeric factors: (nr)(2)nr(3)r\binom{n}{r}(2)^{n-r}(-3)^{r}.
Recall Feynman: explain to a 12-year-old

Imagine nn light switches, each either "aa-on" or "bb-on". Flipping all switches every possible way and writing down the result gives the expansion. To get "exactly rr switches on bb", count how many ways to choose those rr switches — that's (nr)\binom{n}{r}. Add up all the ways and you've built (a+b)n(a+b)^n without memorising a thing.


Connections

  • Pascal's Triangle — the coefficients row by row.
  • Combinations nCr — the counting engine (nr)\binom{n}{r}.
  • Factorials — how (nr)\binom{n}{r} is computed.
  • Binomial Probability Distribution — same (nr)prqnr\binom{n}{r}p^r q^{n-r} powers a random experiment.
  • Taylor & Maclaurin Series — generalised binomial (1+x)α(1+x)^\alpha for non-integer α\alpha.
  • Permutations vs Combinations — why order doesn't matter here.

Concept Map

pick a or b each bracket

counting gives

sum over r

has

coeffs form

exponents sum to n

extract

equals

set exponent = k

set exponent = 0

plug in r

(a+b)^n = n brackets

choose b from r brackets

binomial coeff nCr

Binomial theorem

n+1 terms

Pascal's triangle row n

a decreases, b increases

General term T r+1

nCr a^(n-r) b^r

find term with x^k

constant term

worked expansion (x+2)^4

Hinglish (regional understanding)

Intuition Hinglish mein samjho

Binomial theorem ka core idea ekdum simple hai: jab tum (a+b)(a+b) ko nn baar multiply karte ho, to har term banane ke liye tumhe har bracket se ya to aa lena hai ya bb. Agar tum bb ko exactly rr brackets se choose karte ho, to woh choose karne ke tareeke (nr)\binom{n}{r} hote hain — bas isi wajah se coefficient mein (nr)\binom{n}{r} aata hai. Kuch ratna nahi, sirf counting samajhna hai.

Formula yaad rakho: (a+b)n=(nr)anrbr(a+b)^n=\sum \binom{n}{r}a^{n-r}b^r. Dhyaan do — aa ki power ghatti hai (n0n\to0), bb ki power badhti hai (0n0\to n), aur dono ka sum hamesha nn rehta hai. General term hai Tr+1=(nr)anrbrT_{r+1}=\binom{n}{r}a^{n-r}b^r. Yeh r+1r+1 isliye hai kyunki counter r=0r=0 se start hota hai.

Exam mein sabse common questions: "xkx^k wala term nikaalo" ya "constant term nikaalo". Trick same hai — pura term ek single power of xx ke roop mein likho, phir uski exponent ko kk (ya constant ke liye 00) ke barabar rakh ke rr solve karo. Bas rr mil gaya to term ready.

Sabse badi galti: jab aa ya bb ke saath number ya power lagi ho (jaise 2x2x ya 3x2\frac{-3}{x^2}), tab coefficient sirf (nr)\binom{n}{r} nahi hota — usmein 2nr2^{n-r}, (3)r(-3)^r jaise numeric factors bhi multiply hote hain. Aur negative sign ko kabhi mat bhoolna, warna answer ka sign ulta ho jaayega. Yeh dhyaan rakhoge to full marks pakke.

Go deeper — visual, from zero

Test yourself — Statistics & Probability — Intermediate

Connections