Binomial theorem — expansion, general term: Visual walkthrough

2.7.12 · D2 · Maths › Statistics & Probability — Intermediate › Binomial theorem — expansion, general term

Shuru karne se pehle, do symbols ko samajhna zaroori hai, kyunki parent note ne unhe seedha use kar liya tha.

Step 1 — "Multiply brackets" ka asli matlab kya hai

WHAT. Hum $(a + b)^{n}$ ko $n$ alag-alag brackets ki row ke roop mein likhte hain, har copy ke liye ek bracket.

$(a + b)^{n} = ↑ n brackets, each offers a choice of a or b (a + b) (a + b) \dots (a + b)$

WHY. Kyunki sums ka multiplication ek rule follow karta hai jo tum $(a + b) (c + d) = a c + a d + b c + b d$ se jaante ho: har possible combination mein har bracket se ek term uthao aur apne picks ko multiply karo. Structure dekhne ke liye, humein pehle collapse karna band karna hoga aur brackets ki row ko bas dekhna hoga.

PICTURE. Neeche, har bracket ek black box hai. Har box se ek arrow nikalta hai — tum abhi us box mein haath daalne wale ho aur ya toh $a$ ya $b$ uthane wale ho har box se.

Figure — Binomial theorem — expansion, general term

$n$ boxes ki row ← $(a + b)$ ki $n$ copies.
Har box ke exactly do exits hain ( $a$ ya $b$ ) ← ek bracket ke andar ke do terms.

Step 2 — Ek "pick" = ek raw term

WHAT. Hum ek poora choice karte hain: har box mein haath daalo aur exactly ek letter uthao. Utha ye gaye letters ko multiply karo. Wo product ek single raw term hai.

Jaise, $n = 4$ ke saath, $a, b, a, b$ uthane par raw term milta hai $a \cdot b \cdot a \cdot b = a^{2} b^{2} .$

Chaar factors ← charon boxes mein se ek-ek letter nikala.
$a^{2} b^{2}$ ← hum bas count karte hain ki kitne $a$ 's aur kitne $b$ 's humne uthaye.

WHY. Poora expansion kuch nahi bas har possible raw term ka sum hai. Toh agar hum ek raw term samjh lein, aur phir unhe count kar lein, kaam khatam. Koi algebra magic nahi — pure bookkeeping.

PICTURE. Boxes mein se ek highlighted path (red mein) ek raw term hai. Alag paths = alag raw terms.

Step 3 — Raw terms ko "kitne $b$ 's" ke hisaab se group karo

WHAT. Hum saare raw terms ko piles mein sort karte hain. Do raw terms ek hi pile mein jaate hain jab unhone $b$ utni hi baar uthaya ho. Us number ko $r$ kehte hain.

Agar kisi term ne exactly $r$ boxes se $b$ uthaya, toh usne baaki $n - r$ boxes se $a$ uthaya, isliye us pile ka har raw term barabar hoga $a^{n - r} b^{r} .$

$r$ ← un boxes ki count jinse $b$ mila (ho sakta hai $0, 1, 2, \dots, n$ ).
$n - r$ ← "jo bacha," woh boxes jinse $a$ mila.
Dono exponents ka sum hamesha $n$ hota hai: $(n - r) + r = n$ . (Isliye $a$ ki power ghatti hai jab $b$ ki power badhti hai — share karne ke liye sirf $n$ boxes hain.)

WHY. Sorting se raw products ka unmanageable jumble chhote piles mein badal jaata hai, ek har $r$ ki value ke liye. Ek pile ke andar har term identical hoti hai ( $a^{n - r} b^{r}$ ), isliye ek pile add karna sirf count karna hai ki usme kitne terms hain.

PICTURE. $n = 4$ ke liye teen example piles: $r = 0$ pile (sab $a$ ), ek $r = 2$ pile, $r = 4$ pile (sab $b$ ). Ek pile mein har card same power-product dikhata hai.

Step 4 — Ek pile ko count karna hi $(r n)$ hai

WHAT. Hum count karte hain ki $r$ label wali pile mein kitne raw terms hain. Us pile ka ek raw term tab fix hota hai jab tum decide karo $n$ boxes mein se kaunse $r$ boxes ne $b$ diye. Toh:

$# (terms in pile r) = (number of ways to choose r boxes out of n) = (r n) .$

$(r n)$ (padho " $n$ choose $r$ ") ← combination count. Chosen boxes ki order matter nahi karti (Step 2 ne dikhaya letters commute karte hain), isliye hum combination use karte hain, permutation nahi.
Isse factorials se compute karte hain: $(r n) = \frac{n !}{r ! ( n - r )!}$ .

WHY THIS TOOL AND NOT ANOTHER. Humein chahiye " $r$ boxes ka unordered set choose karne ke tarike." Yahi $(r n)$ ki definition hai. Ek permutation box-1-phir-box-3 se $b$ aur box-3-phir-box-1 se $b$ ko alag count karta — lekin dono identical raw term dete hain, toh hum over-count kar dete. Combinations exactly woh tool hai jo order ignore karta hai.

PICTURE. $n = 4$ , $r = 2$ ke liye: 4 mein se 2 boxes ke har choice ko list karo. $(2 4) = 6$ hain, 6 patterns ke roop mein draw kiye gaye jisme do red boxes hain.

Step 5 — Piles ko add karo: theorem nikal aata hai

WHAT. Har raw term exactly ek pile mein hoti hai, aur piles $r = 0, 1, 2, \dots, n$ se label hain. Saari piles ka sum poore product ko reconstruct karta hai:

$(a + b)^{n} = \sum_{r = 0}^{n} (r n) a^{n - r} b^{r} .$

$r = 0 \sum n$ ← "har pile ke liye ek contribution add karo", $r$ har possible number of $b$ 's par jaata hua.
Pile term ← exactly wahi jo Step 4 ne diya tha.

WHY. Kuch miss nahi hai (har raw term kisi pile mein hai) aur kuch double-count nahi hua (har raw term ek pile mein hai). Toh piles ka sum poore expansion ke barabar hai. Humne koi formula memorise nahi kiya — yeh counting se force hua. ∎

PICTURE. $n = 4$ ke liye piles ki row left to right lined up, har ek $(r 4) a^{4 - r} b^{r}$ se label, neeche ek bracket jisme " $+$ " likha hai — final assembly.

$n = 4$ ke liye yeh padha jaata hai $(a + b)^{4} = (0 4) a^{4} + (1 4) a^{3} b + (2 4) a^{2} b^{2} + (3 4) a b^{3} + (4 4) b^{4} = a^{4} + 4 a^{3} b + 6 a^{2} b^{2} + 4 a b^{3} + b^{4} .$

Step 6 — Edge aur degenerate cases (kabhi skip mat karo)

WHAT / WHY / PICTURE, woh saare corners jo naive picture ko bhi handle karne chahiye:

PICTURE. Teen end/degenerate cases stack karke: $r = 0$ card, $r = n$ card, aur akela $n = 0$ card.

Step 7 — General term padhna

WHAT. $r$ label wali pile ko ek human-friendly naam do. Kyunki $r$ $0$ se shuru hota hai, pile $r = 0$ 1st term hai, $r = 1$ 2nd term, aur aage bhi. Isliye pile $r$ term number $r + 1$ hai:

$T_{r + 1} = (r n) a^{n - r} b^{r} .$

$T_{r + 1}$ ← $(r + 1)$ -th term ka naam (subscript counter $r$ se ek aage hai).
Baaki sab ← Step 4 ki pile.

WHY. Exams ke liye yeh workhorse hai: $x^{k}$ wala term dhundhne ke liye $T_{r + 1}$ ko $x$ ki ek power mein likho, exponent ko $k$ karo, $r$ solve karo. Constant term ke liye exponent $0$ karo.

PICTURE. Pile row phir se, ab neeche ek "term counter" ruler ke saath: pile $r = 0$ " $T_{1}$ " ke upar hai, pile $r = 1$ " $T_{2}$ " ke upar, … "+1 shift" visible ho raha hai.

Ek-picture summary

Sab kuch ek saath: $n$ boxes → $r$ mein $b$ choose karo → $(r n)$ tarike → har ek $a^{n - r} b^{r}$ deta hai → $r$ par sum karo → theorem.

Recall Feynman retelling — poori walkthrough ek 12-saal ke bachche ko explain karo

$n$ light switches line up karo. Har switch ya toh " $a$ " par flip hai ya " $b$ " par. Har possible flip pattern, ek baar jab labels multiply ho jaayein, answer ka ek term hai. Do patterns jo $b$ ko utni hi baar flip karte hain woh identical result $a^{n - r} b^{r}$ dete hain — order matter nahi kiya. Toh patterns list karne ki jagah bas count karo ki kitne patterns exactly $r$ switches ko $b$ par flip karte hain: woh count $(r n)$ hai (" $n$ choose $r$ "). Count ko uske shared result se multiply karo, har possible $r$ ke liye $0$ se $n$ tak add karo, aur tumne $(a + b)^{n}$ rebuild kar liya — koi formula memorise nahi hua, sirf careful counting.

Recall Quick self-test

$a^{n - r} b^{r}$ ka coefficient $(r n)$ kyun hai? ::: Yeh count karta hai ki $n$ brackets mein se kitne se hum $b$ choose karte hain; aisi saari choices same $a^{n - r} b^{r}$ mein collapse ho jaati hain, isliye hum unhe add karte hain. $T_{r + 1}$ kyun, $T_{r}$ kyun nahi? ::: Pile counter $r$ $0$ se shuru hota hai, isliye pile $r = 0$ 1st term hai — term index ek aage chalta hai. $(a + b)^{0}$ kya deta hai aur kyun? ::: $1$ — zero boxes matlab ek empty choice, $(0 0) a^{0} b^{0} = 1$ .

Connections

Binomial theorem — expansion, general term — parent result jo yahan derive hua.
Combinations nCr — counting engine jo har pile ka size produce karta hai.
Permutations vs Combinations — kyun order-free counting ( $(r n)$ ) sahi hai.
Factorials — $(r n)$ actually kaise compute hota hai.
Pascal's Triangle — pile sizes, row by row.
Binomial Probability Distribution — same $(r n) p^{r} q^{n - r}$ ek random experiment power karta hai.
Taylor & Maclaurin Series — idea ko non-integer $α$ ke liye $(1 + x)^{α}$ tak extend karta hai.