2.7.12 · D3 · Maths › Statistics & Probability — Intermediate › Binomial theorem — expansion, general term
Intuition Yeh page kis liye hai
Parent note ne tumhe ek weapon diya tha: T r + 1 = ( r n ) a n − r b r . Lekin exam questions us weapon ko disguises mein dress karte hain — negative b , fractional powers, "constant term nikalo", "do terms equal hain", word problems. Yeh page har disguise ko ek table par rakhta hai, phir har ek ko fully worked example se defeat karta hai. End tak tumhe koi bhi binomial question aisa nahi milna chahiye jiska shape tumne pehle na dekha ho.
Har binomial-expansion question actually kuch independent "knobs" ka combination hota hai. Yahan saare knobs ka full set hai aur woh kya values le sakte hain:
Knob (kya vary karta hai)
Possible values
Kaun sa example hit karta hai
Sign of b
b > 0 (plain) / b < 0 (alternating signs)
Ex 1 (+ ), Ex 3 (− )
Numeric factor inside a , b
none (baby case 1 + x ) / present (2 x , 3/ x 2 )
Ex 1 (none), Ex 3 (both)
Goal type
full expansion / specific power x k / constant term / coefficient only
Ex 1, Ex 2, Ex 3, Ex 6
Parity of n
n even (one middle term) / n odd (two middle terms)
Ex 4 (even), Ex 5 (odd)
Degenerate exponent
no valid r exists (term absent!)
Ex 7
Word / real-world
probability-flavoured story
Ex 8
Exam twist
two conditions at once (equal terms / ratio)
Ex 9
Non-standard n
n = 0 (trivial) / n negative or fractional (infinite series)
Ex 10
Is table ko padhne ka rule: har row se ek value chuno aur tumne ek possible question describe kar liya. Neeche ke das examples is liye choose kiye gaye hain taaki har row ki har value kam se kam ek baar aaye .
Is example se pehle, yahan wo coefficient tool hai jis par hum lean karte hain — Pascal's Triangle scratch se banaya hua:
Figure (alt text): Pascal's Triangle ki pehli chhe rows ek pyramid ki tarah midnight-navy par draw ki gayi hain. Har number uske do diagonally upar wale numbers ka sum hota hai (do green arrows har interior entry mein neeche point karte hain). Row 0 upar ek single 1 hai; row 5 neeche 1 5 10 10 5 1 padhti hai — yellow mein highlight ki gayi hai kyunki Example 1 exactly usi row ka use karta hai. Edges sab 1 's hain (blue), kyunki ( 0 n ) = ( n n ) = 1 .
( 1 + x ) 5 ko completely expand karo.
Forecast: aage padhne se pehle — kitne terms honge, aur middle term ka coefficient kya hoga? Apna guess likho.
Step 1. a = 1 , b = x , n = 5 identify karo, toh T r + 1 = ( r 5 ) 1 5 − r x r = ( r 5 ) x r .
Yeh step kyun? Jab a = 1 , toh factor 1 5 − r = 1 vanish ho jaata hai — yeh baby case hai jahan coefficient purely ( r 5 ) hota hai, kuch nahi. Yeh ek aisa case hai jahan "coefficient = ( r n ) " poori tarah sach hai.
Step 2. Coefficients ko upar wale triangle ki row 5 se padho (yellow highlight): 1 , 5 , 10 , 10 , 5 , 1 .
Yeh step kyun? Pascal's Triangle ki row n hi list ( 0 n ) , … , ( n n ) hoti hai — jab row choti ho toh har factorial compute karne ki zaroorat nahi.
Step 3. x ki badhti powers attach karo:
( 1 + x ) 5 = 1 + 5 x + 10 x 2 + 10 x 3 + 5 x 4 + x 5 .
Verify: n + 1 = 6 terms hain ✓. x = 1 set karo: left side 2 5 = 32 hai; right side 1 + 5 + 10 + 10 + 5 + 1 = 32 hai ✓. (x = 1 set karna saare coefficients sum karta hai — ek classic sanity check.)
( 1 + x ) 10 mein x 7 wala term nikalo.
Forecast: tumhara kya khayal hai kaun sa r x 7 produce karta hai? Step 2 se pehle guess karo.
Step 1. T r + 1 = ( r 10 ) x r .
Yeh step kyun? Ex 1 jaisi hi baby-case shape — x ki power simply counter r hai.
Step 2. Power ko target ke barabar set karo: r = 7 .
Yeh step kyun? Sirf wahi cheez jo hum ek request ke against match kar sakte hain woh x ka exponent hai. Isse 7 ke barabar set karna pin down karta hai ki hum kaun sa term chahte hain.
Step 3. T 8 = ( 7 10 ) x 7 = 120 x 7 .
Yeh step kyun? r = 7 ka matlab term index r + 1 = 8 hai; ( 7 10 ) = ( 3 10 ) = 120 .
Verify: ( 7 10 ) = 7 ! 3 ! 10 ! = 6 10 ⋅ 9 ⋅ 8 = 120 ✓. Symmetry ( 7 10 ) = ( 3 10 ) ✓.
Yeh ek saath teen matrix cells hit karta hai — "boss fight".
( 2 x 2 − x 1 ) 9 mein x se independent term nikalo.
Forecast: kya tumhara answer positive hoga ya negative? Ek guess likho — sign wahi jagah hai jahan zyaadatar log slip karte hain.
Step 1. a = 2 x 2 , b = − x 1 , n = 9 likho:
T r + 1 = ( r 9 ) ( 2 x 2 ) 9 − r ( − x 1 ) r .
Yeh step kyun? Poora signed b , minus samete, substitute karo. b ko + x 1 treat karna ( − 1 ) r silently drop kar dega.
Step 2. Har factor ko (number)(power of x ) mein split karo:
T r + 1 = ( r 9 ) 2 9 − r ( − 1 ) r x 2 ( 9 − r ) x − r = ( r 9 ) 2 9 − r ( − 1 ) r x 18 − 3 r .
Yeh step kyun? Saare x 's ko ek exponent 18 − 3 r mein collect karte hain taaki isse target ke against set kar sakein. Numeric part 2 9 − r ( − 1 ) r saath chal raha hai.
Step 3. "x se independent" ka matlab exponent 0 hai: 18 − 3 r = 0 ⇒ r = 6 .
Yeh step kyun? Constant term x 0 hota hai; solve karne se woh unique bracket-count milta hai jo x mita deta hai.
Step 4. T 7 = ( 6 9 ) 2 3 ( − 1 ) 6 = 84 ⋅ 8 ⋅ 1 = 672.
Yeh step kyun? ( 6 9 ) = ( 3 9 ) = 84 ; 2 9 − 6 = 2 3 = 8 ; ( − 1 ) 6 = + 1 (even power ⇒ positive).
Verify: exponent check 18 − 3 ( 6 ) = 0 ✓. Sign: r = 6 even hai, toh ( − 1 ) 6 = + 1 , answer positive = 672 ✓.
( x − x 2 ) 6 ka middle term nikalo.
Forecast: even n = 6 — ek middle term hai ya do? Kaun sa index?
Step 1. a = x , b = − x 2 , n = 6 identify karo, toh general term hai
T r + 1 = ( r 6 ) x 6 − r ( − x 2 ) r .
Yeh step kyun? Hamesha pehle a , b , n name karo aur general term likho, exactly Ex 1–3 ki tarah. Signed b = − x 2 abhi substitute karna guarantee karta hai ki minus automatically carry ho jaata hai.
Step 2. n = 6 even hai, toh position 2 n + 1 = 4 par ek single middle term hai, yaani r = 3 .
Yeh step kyun? n + 1 = 7 terms ke saath, exact centre 4th hai; T r + 1 mein r + 1 = 4 se r = 3 milta hai.
Step 3. T 4 = ( 3 6 ) x 6 − 3 ( − x 2 ) 3 = ( 3 6 ) x 3 ⋅ ( − 2 ) 3 x − 3 .
Yeh step kyun? Signed − x 2 ko intact rakho; ( − 2 ) 3 negative hoga.
Step 4. T 4 = 20 ⋅ ( − 8 ) ⋅ x 0 = − 160.
Yeh step kyun? ( 3 6 ) = 20 , ( − 2 ) 3 = − 8 , aur x 3 x − 3 = x 0 = 1 .
Verify: ( 3 6 ) = 6 6 ⋅ 5 ⋅ 4 = 20 ✓. Sign: r = 3 odd ⇒ ( − 2 ) 3 < 0 ⇒ negative = − 160 ✓.
( 2 + x ) 7 ke do middle terms nikalo.
Forecast: odd n = 7 se 8 terms milte hain — beech mein kaun se do baithe hain?
Step 1. n + 1 = 8 terms (even count) ke saath, koi single centre nahi hai; do middle terms 4th aur 5th hain, yaani r = 3 aur r = 4 .
Yeh step kyun? Jab n odd hota hai toh terms ki sankhya even hoti hai, isliye centre do terms ke beech padta hai — dono "middle" hain. Positions 2 n + 1 = 4 aur 2 n + 3 = 5 hain.
Step 2. T 4 = ( 3 7 ) 2 7 − 3 x 3 = 35 ⋅ 16 x 3 = 560 x 3 .
Yeh step kyun? Yahan a = 2 numeric weight 2 n − r carry karta hai; isse bhool jao aur coefficient galat ho jaayega.
Step 3. T 5 = ( 4 7 ) 2 7 − 4 x 4 = 35 ⋅ 8 x 4 = 280 x 4 .
Yeh step kyun? ( 4 7 ) = ( 3 7 ) = 35 ; power 2 3 = 8 shrink hoti hai jaise r badhta hai kyunki a ka exponent shrink hota hai.
Verify: ( 3 7 ) = 35 ✓. 2 4 = 16 ⇒ 35 ⋅ 16 = 560 ✓; 2 3 = 8 ⇒ 35 ⋅ 8 = 280 ✓.
( 3 + 2 x ) 7 mein x 5 ka coefficient nikalo.
Forecast: kya woh chhota number hoga ya bada? (Dono 3 n − r aur 2 r add ho jaate hain.)
Step 1. T r + 1 = ( r 7 ) 3 7 − r ( 2 x ) r = ( r 7 ) 3 7 − r 2 r x r .
Yeh step kyun? Dono letters numbers carry karte hain, toh coefficient ( r 7 ) 3 7 − r 2 r hai — sirf ( r 7 ) nahi.
Step 2. x ki power r hai; r = 5 set karo.
Yeh step kyun? Hum x 5 chahte hain, aur exponent counter ke barabar hai, toh r = 5 seedha milta hai.
Step 3. Coefficient = ( 5 7 ) 3 2 2 5 = 21 ⋅ 9 ⋅ 32 .
Yeh step kyun? ( 5 7 ) = ( 2 7 ) = 21 , 3 7 − 5 = 3 2 = 9 , 2 5 = 32 .
Step 4. 21 ⋅ 9 = 189 ; 189 ⋅ 32 = 6048 .
Verify: ( 5 7 ) = 21 ✓, 3 2 ⋅ 2 5 = 9 ⋅ 32 = 288 , 21 ⋅ 288 = 6048 ✓.
Matrix mein ek nasty cell hai jo zyaadatar notes skip karte hain: agar r ki equation ka koi whole-number solution nahi hai? Toh requested term simply expansion mein nahi hoga.
( x 3 + x 1 ) 8 mein x 5 ka term hai?
Forecast: haan ya nahi? Solve karne se pehle answer dene ki koshish karo.
Step 1. T r + 1 = ( r 8 ) ( x 3 ) 8 − r x − r = ( r 8 ) x 24 − 3 r − r = ( r 8 ) x 24 − 4 r .
Yeh step kyun? Ek single power 24 − 4 r mein collapse karo taaki target exponent dhundh sakein.
Step 2. 24 − 4 r = 5 ⇒ 4 r = 19 ⇒ r = 4 19 = 4.75 set karo.
Yeh step kyun? r zaroor { 0 , 1 , … , 8 } mein se ek whole number hona chahiye kyunki yeh brackets count karta hai. Fraction impossible hai.
Step 3. Kyunki r = 4.75 integer nahi hai, koi x 5 term nahi hai — iska coefficient 0 hai.
Yeh step kyun? Is expansion mein har exponent 24 − 4 r form ka hai, yaani yeh 4 ki steps mein girta hai: 24 , 20 , 16 , 12 , 8 , 4 , 0 , … — 5 kabhi nahi aata.
Verify: r = 0..8 ke liye reachable exponents { 24 , 20 , 16 , 12 , 8 , 4 , 0 , − 4 , − 8 } hain; 5 ∈ / is set mein ✓, toh answer "exist nahi karta" sahi hai.
Binomial coefficients sirf algebra nahi hain — yeh count karte hain. Yeh example wahi ( r n ) engine use karta hai jo Binomial Probability Distribution ko power karta hai.
Worked example Ek fair coin
6 baar toss ki jaati hai. ( H + T ) 6 ki expansion ko ek bookkeeping device ki tarah use karte hue, 2 6 equally-likely outcomes mein se kitne mein exactly 2 heads hain?
Forecast: 64 total outcomes mein se count guess karo.
Step 1. Symbolically expand karo: ( H + T ) 6 = ∑ r = 0 6 ( r 6 ) H 6 − r T r .
Yeh step kyun? Har toss ek bracket se H ya T choose karta hai — exactly "switch" picture. Term H 6 − r T r un saari sequences ko collect karta hai jinmein 6 − r heads aur r tails hain.
Step 2. "Exactly 2 heads" ka matlab 6 − r = 2 , toh r = 4 (chaar tails). Matching term H 2 T 4 hai jiska coefficient ( 4 6 ) = 15 hai.
Yeh step kyun? Hum count sahi term ke coefficient se padhna chahte hain, H 2 T 4 , jiska index r = 4 hai. Woh coefficient ( 4 6 ) count karta hai ki 6 tosses mein se kaun se 4 tails hain.
Step 3. Equivalently, seedha count karo ki kaun se 2 tosses heads hain: ( 2 6 ) = 15 .
Yeh step kyun? Symmetry ( 4 6 ) = ( 2 6 ) se — 4 tails choose karna wahi hai jaise bacha hua 2 heads choose karna. Dono counts same 15 dete hain, toh "heads count karo" aur "tails count karo" agree karte hain. Isliye students bina galti ke ( 2 6 ) likh sakte hain.
Step 4. (Bonus) probability = 2 6 15 = 64 15 .
Yeh step kyun? 64 sequences mein se har ek equally likely hai, aur 15 favourable hain.
Verify: total sequences ∑ r ( r 6 ) = 2 6 = 64 ✓ (H = T = 1 set karo). Favourable ( 4 6 ) = ( 2 6 ) = 15 ✓.
( 1 + x ) n mein x r aur x r + 1 ke coefficients equal hain, aur yeh n = 15 par r = 7 ke liye hota hai. Isse verify karo, aur general rule nikalo.
Forecast: n aur r ke beech kaun sa relation do neighbouring coefficients ko match karne par majboor karta hai?
Step 1. x r ka coefficient ( r n ) hai; x r + 1 ka ( r + 1 n ) hai. Inhe equal set karo.
Yeh step kyun? Yeh baby case hai, toh coefficients pure binomials hain — twist dono mein se do ko compare karna hai.
Step 2. Ratio ( r n ) ( r + 1 n ) = r + 1 n − r use karo. Coefficients ko equal set karne ka matlab hai yeh ratio = 1 hai:
r + 1 n − r = 1 ⇒ n − r = r + 1 ⇒ n = 2 r + 1.
Yeh step kyun? Consecutive binomial coefficients ka ratio sabse cleanest tool hai — yeh ek factorial equation ko ek one-line linear equation mein badal deta hai.
Step 3. Toh equality exactly tab hoti hai jab n odd ho aur r = 2 n − 1 : do middle coefficients equal hote hain.
Yeh step kyun? n = 2 r + 1 precisely woh odd case hai jahan do middle terms exist karte hain (Ex 5) — woh symmetry ( r n ) = ( r + 1 n ) se same coefficient share karte hain.
Step 4. Diye gaye numbers check karo: n = 15 ⇒ r = 2 15 − 1 = 7 ✓, aur ( 7 15 ) = ( 8 15 ) = 6435 .
Verify: ( 7 15 ) = 6435 aur ( 8 15 ) = 6435 equal hain ✓; n = 2 ( 7 ) + 1 = 15 ✓.
Parent note mein theorem ne assume kiya tha ki n ek positive integer hai. Do edge cases us se bahar hain: trivial n = 0 , aur negative/fractional n jahan expansion ek infinite series ban jaati hai — Taylor & Maclaurin Series ka gateway.
Definition Falling product (neeche zaroori hai)
n ka r factors ke saath falling product matlab: n se shuru karo aur ek ek step neeche multiply karo, exactly r factors use karo:
n ( n − 1 ) ( n − 2 ) ⋯ ( n − r + 1 ) ( r factors ) .
Example: n = 2 1 aur r = 2 ke saath yeh 2 1 ⋅ ( 2 1 − 1 ) = 2 1 ⋅ ( − 2 1 ) = − 4 1 hai — sirf do factors, 2 1 se neeche count karte hue. Khas baat yeh hai ki isse kabhi fraction ka factorial compute nahi karna padta, toh yeh tab bhi chalti hai jab n whole number nahi hota.
( a + b ) 0 expand karo. (b) ( 1 + x ) − 1 aur ( 1 + x ) 1/2 ke pehle teen terms likho, ∣ x ∣ < 1 ke liye valid.
Forecast: har ek mein kitne terms hain — finite ya endless?
Step 1 (trivial case). ( a + b ) 0 = 1 kisi bhi a , b ke liye (dono zero nahi).
Yeh step kyun? n = 0 ke saath exactly n + 1 = 1 term hota hai: ( 0 0 ) a 0 b 0 = 1 . Sum turant ruk jaata hai — sabse chhoti possible expansion.
Step 2 (finite formula kyun fail hota hai). Ek positive integer n ke liye, factor ( n − r ) eventually r = n + 1 par 0 ho jaata hai, jo baad ke har term ko kill kar deta hai — isi wajah se sum n par ruk jaata hai. Jab n negative ya fractional hota hai, ( n − r ) kabhi 0 nahi hota, toh koi term kabhi kill nahi hoti: series forever chalti rehti hai.
Yeh step kyun? Yeh exact mechanism point karta hai: finiteness ek factor ke zero hone se aati hai, aur non-integer n us zero ko hata deta hai.
Step 3 (generalised coefficient). Kisi bhi real n ke liye coefficient falling product use karta hai (upar defined), factorials nahi:
( r n ) = r ! n ( n − 1 ) ( n − 2 ) ⋯ ( n − r + 1 ) .
Yeh step kyun? Usual ( r n ) = r ! ( n − r )! n ! ko ( n − r )! chahiye, jo fractional n ke liye meaningless hai (koi "( − 2 3 ) ! " nahi hota). Top ko falling product se replace karne par ( n − r )! completely hata jaata hai, toh coefficient ab bhi sense karta hai — aur whole n ke liye pehle jaisa number deta hai.
Step 4 (( 1 + x ) − 1 compute karo, n = − 1 ). Falling-product coefficients hain ( 0 − 1 ) = 1 , ( 1 − 1 ) = 1 − 1 = − 1 , ( 2 − 1 ) = 2 ( − 1 ) ( − 2 ) = 1 . x ki powers attach karo:
( 1 + x ) − 1 = 1 − x + x 2 − ⋯ ( ∣ x ∣ < 1 ) .
Yeh step kyun? x ki powers ab bhi x 0 , x 1 , x 2 , … exactly finite case ki tarah chadhti hain; sirf coefficients ab falling product se aate hain.
Step 5 (( 1 + x ) 1/2 compute karo, n = 2 1 ). Coefficients ( 0 1/2 ) = 1 , ( 1 1/2 ) = 1 1/2 = 2 1 , ( 2 1/2 ) = 2 2 1 ⋅ ( − 2 1 ) = − 8 1 . Isliye
( 1 + x ) 1/2 = 1 + 2 1 x − 8 1 x 2 + ⋯ ( ∣ x ∣ < 1 ) .
Yeh step kyun? Wahi recipe — top par falling product, neeche r ! — ab n = 2 1 par apply ki gayi.
Step 6 (∣ x ∣ < 1 kyun?). Series mein infinitely many terms hain, toh yeh function ke barabar tab hoti hai jab woh terms kuch nahi ban jaayein . Powers x r sirf tab shrink hoti hain jab ∣ x ∣ < 1 ho (e.g. 0. 5 r → 0 ); agar ∣ x ∣ ≥ 1 terms khatam nahi hote aur endless sum ki koi finite value nahi hoti. Toh expansion sirf ∣ x ∣ < 1 ke andar trustworthy hai — yeh infinitely many terms ki kimat hai, jo positive-integer case kabhi nahi chukta kyunki uska sum finite hota hai.
Yeh step kyun? Ek finite sum hamesha valid hoti hai; ek infinite wali ko apne terms ka vanish hona zaroori hai. Woh region batana jahan aisa hota hai answer ka hissa hai, afterthought nahi.
Verify: ( 1 + x ) − 1 = 1 + x 1 jaani-pehchaani geometric series 1 − x + x 2 − ⋯ hai (∣ x ∣ < 1 ke liye valid) ✓. 1 + 2 1 x − 8 1 x 2 ko square karne par 1 + x + O ( x 3 ) milta hai, jo ( 1 + x ) 1/2 squared = 1 + x se match karta hai ✓.
Figure (alt text): ek graph jo x ka exponent (vertical axis) ko counter r (horizontal axis) ke against plot karta hai humare teen expansions ke liye. Blue line 18 − 3 r ( 2 x 2 ± x 1 ) 9 hai (Ex 2/3); green line 24 − 4 r ( x 3 + x 1 ) 8 hai (Ex 7). Ek dashed yellow horizontal line "constant term" target (0 ) mark karti hai aur ek dashed red line target x 5 mark karti hai. Ek specific term padhna bas ek dot pick karna hai; "x k term dhundho" woh jagah dhundha hai jahan ek coloured line ek horizontal target cross kare; "aisa koi term nahi" (Ex 7) woh hai jab target height do dots ke beech baith jaaye aur kabhi kisi par na utare — red line kabhi kisi green dot ko touch nahi karti.
Recall Forecast then verify
( 3 + 2 x ) 7 mein x 5 ka coefficient? ::: 6048 .
Kya ( x 3 + 1/ x ) 8 mein x 5 term hai? ::: Nahi — r = 4.75 integer nahi hai.
( 2 x 2 − 1/ x ) 9 mein x se independent term? ::: 672 (r = 6 par).
6 -toss outcomes ki sankhya jinmein exactly 2 heads hain? ::: ( 2 6 ) = ( 4 6 ) = 15 .
( 1 + x ) n ke consecutive coefficients equal kab hote hain? ::: Jab n = 2 r + 1 (odd n , do middle terms).
( 1 + x ) − 1 ke pehle teen terms ∣ x ∣ < 1 ke liye? ::: 1 − x + x 2 − ⋯ .
"Collapse, Set, Solve, Sign." x ki ek power mein Collapse karo → exponent ko apne target ke barabar Set karo → r ke liye Solve karo (non-integers reject karo!) → final coefficient mein Sign ( − 1 ) r aur numeric factors carry karo.