Binomial theorem — expansion, general term: Foundations

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

Parent note ki ek bhi line pe trust karne se pehle, tumhe usse padh paana chahiye. Ye page har ek mark ko unpack karta hai, usi order mein jisme ek doosre pe depend karte hain. Kuch bhi assume nahi kiya gaya. Agar baad mein koi aisa symbol mile jo yahan nahi hai, toh woh inhi se bana tha.

1. " $a$ " aur " $b$ " ka matlab yahan — placeholders

Picture yeh hai: $a$ aur $b$ ko do labelled buckets samjho. Jo bhi tum bucket $a$ mein daalte ho woh page par har jagah $a$ rehta hai. Isi liye yeh theorem itna powerful hai — ek baar abstract buckets ke saath prove karo, phir hazaar concrete problems ke liye reuse karo.

Topic ko iske kyun zaroorat hai: binomial theorem ka poora point ek aisa template hai jo tum fill karte ho. Placeholders ke bina tum har nayi problem ke liye sab kuch dobara derive karte.

2. Exponents — "khud se multiply karo"

Picture yeh hai: neeche, $a$ ka har factor ek row mein ek tile hai. Exponent simply kitne tiles hain woh hai.

Figure — Binomial theorem — expansion, general term

Do rules jinhe hum baar baar use karte hain:

Topic ko inki kyun zaroorat hai: parent ke Example 2 mein, $(x^{2})^{9 - r} = x^{2 (9 - r)}$ nesting rule use karta hai, aur $x^{18 - 2 r} \cdot x^{- r} = x^{18 - 3 r}$ combine karna adding rule use karta hai. " $x$ ki ek single power mein combine karo" wala har step inhi do laws mein se ek hai.

3. Negative exponents — powers jo "neeche" rehti hain

Picture yeh hai: positive exponent tiles ko upar (numerator) stack karta hai; negative exponent tiles ko neeche (denominator) stack karta hai. Exponents ki number line zero ke through bina kisi gap ke chalti hai: $\dots, x^{2}, x^{1}, x^{0}, x^{- 1}, x^{- 2}, \dots$

Topic ko iske kyun zaroorat hai: $(x^{2} + \frac{1}{x})^{9}$ jaise problems ke andar $x^{- 1}$ chupa hota hai. $\frac{1}{x} = x^{- 1}$ rewrite karne se hum exponents add kar sakte hain aur ek single power par land karte hain — wahi form jise hum $x^{6}$ jaise target ke barabar set kar sakte hain.

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

Picture yeh hai: $n!$ ek line mein $n$ distinct objects ko arrange karne ke tareekon ki sankhya count karta hai. Pehla object rakho: $n$ choices. Agla: $n - 1$ choices bache. Aur aise $1$ tak. Choices multiply karo — woh product hi $n!$ hai.

Topic ko iske kyun zaroorat hai: coefficient $(r n)$ factorials se bana hota hai. Factorial nahi toh coefficient nahi.

Poori kahaani ke liye Factorials aur Permutations vs Combinations dekho.

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

Formula kahan se aata hai (shuru se):

Chune gaye saare $r$ objects ko order mein lagao: $n \cdot (n - 1) \dots (n - r + 1) = \frac{n !}{( n - r )!}$ aisi ordered lists hain.
Lekin hum order ki parwah nahi karte — wahi $r$ objects $r!$ alag orders mein arrange hone par bhi same choice hain.
Toh $r!$ se divide karo: $(r n) = \frac{n !}{r ! ( n - r )!}$ .

Picture yeh hai: neeche, $n = 4$ brackets mein se $r = 2$ brackets choose karo jo tumhe $b$ dein. Chosen brackets shaded hain; har alag shading ek count hai.

Topic ko iske kyun zaroorat hai: yahi poori wajah hai ki coefficients kyun aate hain. Zyada ke liye Combinations nCr dekho, aur Pascal's Triangle ke liye ki yeh numbers row by row kaise stack hote hain.

6. The summation sign $\sum$ — "ek pattern add karo"

Picture yeh hai: ek conveyor belt. $r$ $0, 1, 2, \dots, n$ tick karta hai; har tick par machine ek term $f (r)$ nikaalti hai; sab ek basket mein girte hain aur sum ho jaate hain.

Parent ki line padhna: $(a + b)^{n} = \sum_{r = 0}^{n} (r n) a^{n - r} b^{r}$ ka matlab hai: $r$ ko $0$ se $n$ tak chalao; har baar, term $(r n) a^{n - r} b^{r}$ banao; sab add karo. Kyunki $r$ $n + 1$ values leta hai ( $0$ se $n$ tak), $== n + 1 ==$ terms hote hain — exactly isi wajah se parent $n + 1$ kehta hai.

Topic ko iske kyun zaroorat hai: "har $r$ ke liye aur aise hi" kehne ka compact tarika hai bina endless line likhe.

7. Counter $r$ vs term number $r + 1$

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

Topic ko iske kyun zaroorat hai: " $k$ -va term dhundho" ka har sawaal insaan ki count aur machine ke $r$ ke beech translate karne par rely karta hai. Yahan galti karna sabse common slip hai (parent ka $T_{r}$ vs $T_{r + 1}$ mistake dekho).

8. Symbols ko order mein rakhna — prerequisite map

Ise upar se neeche padho: placeholders aur powers pehle aate hain, factorials $(r n)$ ko feed karte hain, exponent laws aur $(r n)$ summation ko feed karte hain, aur sab kuch theorem aur uske general term par converge karta hai.

Equipment checklist

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

a^{n}

mein exponent physically kya count karta hai?

Kitne copies of

a

multiply hote hain.

a^{0} = 1

kyun hai?

Empty product kuch bhi multiply nahi karta, aur

1

woh value hai jo kisi bhi product ko unchanged rakhti hai (aur

a^{1} / a = 1

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

ko negative exponent use karke rewrite karo.

x^{- 2}

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

ko ek power mein combine karo.

x^{18 - 3 r}

n!

kya count karta hai?

n

distinct objects ko ek line mein arrange karne ke tareekon ki sankhya.

0! = 1

kyun?

Kuch bhi arrange na karne ka exactly ek tarika hai (kuch mat karo).

Simple shabd mein,

(r n)

kya hai?

n

objects mein se

r

objects choose karne ke tareekon ki sankhya jab order matter nahi karta.

(r n)

ka formula likho.

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

(2 5)

compute karo.

10

\sum_{r = 0}^{n}

tumhe kya karne kehta hai?

r

0

n

tak chalao, har ke liye ek term banao, aur sab add karo.

Yeh kitne terms produce karta hai?

n + 1

5

va term kaun sa counter value

r

deta hai?

r = 4

(kyunki

T_{r + 1}

, toh

r + 1 = 5

Connections

Factorials — $(r n)$ ke peeche multiply-down-to-1 machine.
Combinations nCr — counting engine, yahan puri tarah define kiya gaya.
Permutations vs Combinations — kyun hum $r!$ se divide karte hain (order matter nahi karta).
Pascal's Triangle — coefficients row by row stacked.
Binomial theorem — expansion, general term — parent topic jinhe ye foundations feed karte hain.
Binomial Probability Distribution — wohi $(r n)$ random experiments power karta hai.
Taylor & Maclaurin Series — jahan powers aur coefficients infinite ho jaate hain.