Hum ek infinite sum ∑an=a1+a2+a3+⋯ study karte hain. "Converges" ka matlab hai running totals ek single finite number pe settle ho jaayein; "diverges" ka matlab hai nahi hote.
Recall Is page par naam liye gaye baaki tests ki quick reminders
Comparison test: agar 0≤∣an∣≤bn eventually aur ∑bn converge karta hai, toh ∑∣an∣ converge karta hai. (L<1 case ka engine.)
n-th term divergence test: agar an→0, toh series diverge karti hai. (L>1 case ka engine.)
Ratio test: roots ki jagah lim∣an+1/an∣ dekhta hai; jab wo limit exist kare toh same L deta hai.
p-series rule:∑1/np converge karta hai tab hi jab p>1. (Standard L=1 examples.)
Neeche ki picture poori logic dikhati hai: r ko rooting se nikalo, phir 1 ke against judge karo.
Neeche har trap ek specific weak spot pe attack karta hai: L=1 ka matlab kya hai, proof ko L<r<1 kyun chahiye, n-th roots polynomials vs exponentials ke saath kaise behave karte hain, aur root test ka Ratio test se kya relation hai.
False.L=1 ka matlab hai test koi information nahi deta — ∑1/n diverge karta hai lekin ∑1/n2 converge karta hai, aur dono ka L=1 hai. Aapko p-series rule jaisa koi aur tool switch karna hoga.
Agar L<1 toh series absolutely converge karti hai, sirf conditionally nahi.
True. Proof mein ∣an∣<rn bound milti hai aur ∑rn converge karta hai, isliye ∑∣an∣ converge karta hai — ye exactly absolute convergence hai.
Root test conditional convergence prove kar sakta hai (converges but not absolutely).
False. Ye sirf ∣an∣ ko bound karta hai, isliye "converges" ka verdict hamesha absolute convergence hota hai. Conditional cases ke liye (jaise alternating harmonic series) aapko alternating series test chahiye.
Agar L>1, toh series diverge karti hai kyunki uske partial sums oscillate karte hain.
Reasoning mein False. Ye diverge karta hai kyunki ∣an∣>1 infinitely often hota hai, isliye an→0; n-th term divergence test oscillation se independent divergence force karta hai.
Agar n∣an∣→0, toh series phir bhi diverge ho sakti hai.
False.L=0<1, aur 0 bilkul valid case hai L<1 ka, isliye ye absolutely converge karta hai. L=0 par kuch special nahi hota.
Root test aur Ratio test hamesha same series par agree karte hain.
False. Bahut si series par same L dete hain, lekin root test kuch aisi series par succeed karta hai jahan ratio limit exist hi nahi karti — root test strictly stronger hai.
Agar ratio test inconclusive hai (L=1), toh root test bhi inconclusive hoga.
True (dono same L share karte hain). Jab bhi ratio limit exist kare wo root limit ke barabar hoti hai, isliye ek se 1 aaya toh doosre se bhi 1 aayega. Root test tabhi jeet ta hai jab ratio limit bilkul exist na kare.
L=∞ wali series ko phir bhi alag divergence argument chahiye.
False.L=∞ sirf L>1 ka extreme case hai; same n-th term argument apply hota hai aur test khud divergence conclude karta hai.
"an=n2/2n ke liye, nan ek tiny number ka root hai, isliye L≈0."
Error. Polynomial factors root ho kar 1 dete hain: nn2=n2/n→1. Sirf exponential survive karta hai, L=1/2 milta hai, 0 nahi.
"nn→0 kyunki aap ek bade number ka bada root le rahe ho."
Error.nn=elnn/n aur lnn/n→0, isliye limit e0=1 hai, 0 nahi. Root n se bahut dheere badhta hai — 1 ki taraf chadta hai aur wahi rukta hai, kabhi blow up nahi karta.
"L>1 ka matlab hai terms eventually 1 se zyada ho jaate hain sabhi bade n ke liye."
Error.limsup ke saath, ∣an∣>1 sirf infinitely often hona chahiye, har bade n ke liye nahi. Ye akela an→0 todne ke liye kaafi hai.
"Kyunki koi bhi r jo L<r<1 satisfy kare kaam karta hai, r ki choice proof ko sloppy bana deti hai."
Error. Sirf ek aisa r chahiye jo tail ko dominate kare — ye ek strength hai; existence guaranteed hai kyunki L<1 ek gap chhodta hai. Choice ki freedom ek logically valid step ko weak nahi karti.
"n∣an∣<r sabhi n ke liye hold karta hai, isliye ∣an∣<rn everywhere."
Error. Limit sirf n≥N ke liye bound guarantee karta hai (eventually). Shuru ke finitely many terms convergence ke liye matter nahi karte, isliye hum sirf tail ko compare karte hain.
"∑n33n par root test use karne ke liye, main n3n/n3=3/n3 leta hoon."
Error.nn3=(nn)3→1, n3 nahi. Correct root hai 3/(nn)3→3, jo L=3 deta hai (diverges).
"L=1 borderline hai, toh main kahunga ye 'weakly converge' karta hai."
Error. Aisa koi verdict exist nahi karta. L=1 total silence hai — test kuch contribute nahi karta aur aapko ek alag test use karna hoga.
Root test saari cheez ko sirf Geometric series se kyun compare karta hai aur kisi se nahi?
Kyunki geometric series wo sabse simple family hai jiska convergence hum exactly jaante hain (∣r∣<1), aur nan≈r literally kisi bhi term se hidden geometric ratio nikaal leta hai.
Agar ek term rn jaisi behave kare, toh n-th root "n-baar multiply" ko undo karta hai aur r seedha bahar aa jaata hai. Ye n-th power raise karne ka exact inverse hai, jo ki geometric growth hai.
Definition mein ordinary limit ki jagah limsup kyun use hota hai?
Ordinary limit exist nahi kar sakta (roots forever wobble kar sakte hain), lekin limsup — wo sabse badi value jis par ye baar baar aate hain — hamesha exist karta hai (finite ya ∞), isliye test hamesha defined hai. Exam problems mein plain limit usually exist karta hai aur uske barabar hota hai.
∑1/np mein harp ke liye L=1 kyun hota hai?
n1/np=e−plnn/n aur lnn/n→0, isliye kisi bhi fixed p ke liye exponent vanish ho jaata hai. Root test literally wo exponent p nahi dekh sakta jo convergence decide karta hai.
(stuff)n jaisi terms ke liye root test Ratio test se zyada preferred kyun hai?
n⋅ outer power ko ek clean step mein cancel kar deta hai, jabki ratio test aapko ek messy (⋯)n+1/(⋯)n quotient simplify karne par force karta hai.
L>1 case mein comparison ki jagah n-th term divergence test kyun use hota hai?
Comparison ko ek convergent dominating series chahiye, jo terms ke badhne par fail hoti hai. Isliye hum seedha note karte hain ki terms 0 par nahi jaate, jo ek direct divergence criterion hai.
Hum sirf an→0 se convergence conclude kyun nahi kar sakte?
an→0 necessary hai lekin sufficient nahi — ∑1/n mein terms 0 par jaate hain phir bhi ye diverge karta hai. Root test demand karta hai ki shrinking ki rate geometric ho, jo zyada strong condition hai.
r=1 ke saath ∑rn ke baare mein root test kya kehta hai?
n1=1 sabhi n ke liye, isliye L=1 — inconclusive. Aur sach mein ∑1 diverge karta hai, lekin test nahi bata sakta; ye n-th term test se seedha dikhtaa hai.
0<r<1 ke saath ∑rn (model case) mein kya hota hai?
nrn=r, isliye L=r<1 exactly, aur test convergence confirm karta hai. Root test us family ke liye exact hone ke liye calibrated hai jis se ye compare karta hai.
Agar kuch terms mein an=0 ho — kya n0 test tod deta hai?
Nahi. n0=0, jo sirf values neeche kheenchta hai; limsup zero terms ko fine handle karta hai aur ye kabhi divergence cause nahi karte.
∑(lnn)n1 ke liye L kya hai aur ye clean win kyun hai?
n1/(lnn)n=1/lnn→0, isliye L=0<1, converges. Perfect n-th power root ke neeche instantly collapse ho jaata hai — is test ke liye ideal trigger.
Ek power series ∑cnxn ke liye root test kya ban jaata hai?
Ye Cauchy–Hadamard formula R=1/limsupn∣cn∣ ban jaata hai — root test x fold in karke apply karne se seedha Radius of convergence milta hai.
Agar n∣an∣ do values ke beech oscillate kare, maano 0.4 aur 0.9?
limsupsabse badi recurring value leta hai, yahan 0.9<1, isliye series phir bhi converge karti hai. Ordinary limit use karna fail ho jaata kyunki wo exist nahi karta, aur exactly isliye limsup use hota hai.
Recall Har trap ki ek-line summary
L<1 ⇒ absolute convergence; L>1 ⇒ divergence (terms 0 par nahi); L=1 ⇒ silence. Polynomials root ho kar 1 dete hain, sirf exponentials survive karte hain, aur limsup test ko hamesha defined rakhta hai.