a par centre kyun? Kyunki x=a ke paas term (x−a) bahut chota hota hai, toh zyada powers (x−a)n tezi se shrink karte hain. Series centre ke paas sabse accurate hoti hai, aur pehle kuch terms dominate karte hain (yeh approximation ka 80/20 rule hai).
Hum assume karte hain ki f apni power series ke barabar hai aur jitni baar chaaho differentiate kar sakte ho. Humara kaam: har cn solve karna.
Step 0 — c0 nikaalein. Seedha x=a set karo:
f(a)=c0+c1⋅0+c2⋅0+⋯=c0⇒c0=f(a)Yeh step kyun? Constant ke alaawa har term mein (x−a) ka factor hai, jo x=a par 0 hota hai.
Step 1 — c1 nikaalein. Ek baar differentiate karo:
f′(x)=c1+2c2(x−a)+3c3(x−a)2+⋯
Ab x=a set karo: f′(a)=c1⇒c1=f′(a).
Yeh step kyun? Differentiation ne c0 ko khatam kar diya (constant → 0) aur c1 ko constant slot mein shift kar diya.
Step 2 — c2 nikaalein. Dobara differentiate karo:
f′′(x)=2c2+(3⋅2)c3(x−a)+(4⋅3)c4(x−a)2+⋯x=a set karo: f′′(a)=2c2⇒c2=2f′′(a).
Yeh step kyun?(x−a)2 par power 2 do baar differentiate karne par factor ke roop mein neeche aa gayi: 2⋅1=2!.
Step n — pattern.n baar differentiate karo. Term cn(x−a)n ban jaata hai
n(n−1)(n−2)⋯1⋅cn=n!cn,
aur saare neeche ke terms khatam ho jaate hain jabki upar ke terms mein abhi bhi (x−a) ka factor hota hai. x=a set karo:
f(n)(a)=n!cn⇒cn=n!f(n)(a)
(x−a)n ko ek baar differentiate karne par n(x−a)n−1 milta hai, dobara karne par n(n−1)(x−a)n−2 milta hai… Har derivative current exponent ko ek multiplying factor ke roop mein neeche kheench leta hai. n derivatives ke baad tumne n⋅(n−1)⋯2⋅1=n! se multiply kar diya hota hai. Coefficient mein n! se divide karna ise exactly cancel kar deta hai, toh cn saaf tarike se f(n)(a)/n! ke barabar ho jaata hai.
Socho tum ek curvy slide ko sirf seedhe LEGO pieces se copy karna chahte ho jo thoda moda ja sake.
Pehle tum match karte ho ki slide kahan shuru hoti hai (woh hai f(a)). Phir match karo yeh kitni steep hai (woh hai f′(a)). Phir match karo yeh kaise curve karti hai (f′′(a)), phir curve kaise change hoti hai, aur aise aage.
Har nayi information tumhari LEGO copy ko starting point ke paas real slide se thoda aur acche se chipkaati hai. Taylor series bilkul woh recipe hai jo batati hai ki har LEGO piece kitni badi honi chahiye — aur magic number n! pieces ko bahut bada hone se rokta hai.
Geometric series (ek power series jiske saare coefficients 1 hain)
L'Hôpital's rule (aksar leading Taylor terms se replace kiya ja sakta hai)
Kya cheez ek power series ke coefficients ko jo f ke barabar ho unique hone par majboor karti hai?
n baar differentiate karna aur x=a set karna exactly ek term ko isolate karta hai, cn=f(n)(a)/n! force karta hai.
a ke baare mein n-th Taylor coefficient ka general formula kya hai?
cn=n!f(n)(a)
Taylor coefficients mein n! kyun aata hai?
n differentiations mein se har ek current exponent ko factor ke roop mein neeche kheenchta hai; milke woh n! multiply karte hain, jise division cancel kar deta hai.
cn solve karte waqt sirf ek term ko chhodkar baaki sab ko khatam karne ki trick kya hai?
x=a set karna, toh k≥1 wale har (x−a)k ka maan 0 ho jaata hai.
Maclaurin series kya hoti hai?
a=0 par centred ek Taylor series: ∑f(n)(0)xn/n!.
ex ki Maclaurin series?
∑n=0∞xn/n!
sinx ki Maclaurin series?
∑n=0∞(−1)nx2n+1/(2n+1)!
a=1 par centred series mein kaisi powers aati hain?
(x−1) ki powers, x ki powers nahi.
Kya Taylor derivation guarantee karta hai ki series har jagah f ke barabar hai?
Nahi — sirf coefficients determine hote hain; equality ke liye convergence aur Rn→0 chahiye.
a=1 ke baare mein lnx ke pehle teen nonzero terms?