series review - convergence
\[\large \sum \limits_{n=2}^{\infty } \dfrac{n^2+3n+2}{7^n}\]
the sequence converges as \(\large \lim \limits_{n\to \infty} a_n = 0\) how to go about testing the series ?
u wanna find the sum or only determine converge /diverge
just determine whether its converges/diverges
wolfram is using ratio test, should i try the same ?
\[\large \lim \limits_{n\to \infty} \Bigg |\dfrac{a_{n+1}}{a_n}\Bigg| = \lim \limits_{n\to \infty} \Bigg |\dfrac{((n+1)^2+3(n+1)+2)/7^{n+1}}{(n^2+3n+2)/7^n}\Bigg| \]
\[\large = \lim \limits_{n\to \infty} \Bigg |\dfrac{((n+1)^2+3(n+1)+2)}{7(n^2+3n+2)}\Bigg| \]
somehow this needs to be less than 1
for this i often use limit comparison test , ur series can be defided into 3 series right ?
\[\large = \Bigg |\dfrac{1}{7}\Bigg | \] \[\large \lt 1\] this turned out simple xD
yeah lets try limit comparison now :)
we need to choose a reference series to compare against ?
yep mmm
converge one
how about \(\large \dfrac{6^n}{7^n}\) ?
mmm we need to prove that n^2+3n+2 <6^n
\[\large \sum \limits_{n=2}^{\infty } \dfrac{6^n}{7^n}\] and \[\large \sum \limits_{n=2}^{\infty } \dfrac{n^2 + 3n+2}{7^n}\]
n^2+3n+2 <= 6^n will do right ?
yeah it work ^^
see how the comparison Test work let X:=\((x_n)\) and Y:=\((y_n)\) be real sequences and suppose that for some K\(\in N\) we have \(0\le x_n\le y_n \) for \(n\ge k\) a) then the convergence of \(\sum y_n \) implies the convergence of \(\sum x_n\) b) the divergence of \(\sum x_n\) implies the divergence of \(\sum y_n\)
interesting, so for some \(n \ge k\), if \(0 \le x_n \le y_n\) , then \(x_n\) converges if \(y_n\) converges is it ?
so just by looking at this series , and define any other convergence serieis such as 6^n/7^n > x_n then its converge
yes ^_^
then we could have used 2^n/7^n also as reference series !!
mmm if n^2+3n+2> 2^2 then yes it works
2^n **
1.000000000001^n/7^n also would have worked !! sweet :3
haha :P
cuz, (1.0000000001)^n > an^2+bn+c for some n > k
you have helped me understand the comparison test clearly, thank you !
np :P
comparison test is the fastest test to see convergence :D so do u think \(\sum_{n=1}^{\infty}\frac{1}{n!}\) converge or diverge ?
lets see, i feel ratio test is ideal when dealing with factorials
ratio test for kids :P
ugh :/ ratio test still excites me
ok lol what do u think is it conv/div and why :P
ratio test : \[\large \lim \limits_{n\to \infty} \Bigg |\dfrac{a_{n+1}}{a_n}\Bigg| = \lim \limits_{n\to \infty} \Bigg |\dfrac{1/(n+1)!}{1/n!}\Bigg|\]
\[\large = \lim \limits_{n\to \infty} \Bigg |\dfrac{1}{n+1}\Bigg| \] \[\large = 0\] \[\large \lt 1\] converges
?
yeah it work :)
what about comparison test
for comparison test its enough to know n^2< n! , n>=4 hence 1/n^2 >1/n! >0 for n >=4
so its conv.
whoa yes !!
can we prove 1/n^2 converges quick ?
prove \[\large \sum \limits_{n=1}^{\infty } \dfrac{1}{n^2}\] converges
i know the proof using integral test, so lets try something elsse..
yes its p-series all \(\Huge \sum_{1}^{\infty} \frac{1}{n^p}\) , s.t |p|>1 are converges
yeah can we go through the proof once
the sequence of partial sums is monotonic as all the terms are positive
how to show this is bounded
i like to write the theorm xD let \(x_n\) be a sequence of nonnegative real numbers , Then the series \(\sum x_n\) converges if and only if the sequense S=\((S_k)\) of partial sums is bounded . In this case :- \(\sum_{n=1}^{\infty } x_n=\lim(S_k)=sup[S_k :k \in N]\)
okay so we need to show that the sequence of partial sums is bounded
so as u said since partial sums are monotone we need to show that some subsequensce of \(S_k\) is bounded :P
i used\(s_k\) def.. tell if u wanna me to write it down. if \( k_1 := 2^1-1=1\) then \(S_{k_1}\) =1 if \(k_2:=2^2-1=3\) then \(S_{k_2}=3\) then \(s_{k}=\frac{1}{1}+(\frac{1}{2^2}+\frac{1}{3^2})<1+\frac{2}{2^2}=1+\frac{2}{2 }\) and if\( k_3:=2^3-1=7 \) then we have \(S_{k_3}=S_{k_2}+(\frac{1}{4^2}+\frac{1}{5^2} +\frac{1}{6^2}+\frac{1}{7^2})<S_{k_2}+ \frac{4}{4^2}<1+\frac{1}{2}+\frac{1}{2^2}\) with me so far ?
so if u keep going like this ull gonna note that \(\large 0<S_{K_i<1}+\frac{1}{2}+(\frac{1}{2 })^2+. . . +(\frac{1}{2})^{j-1}\)
are you getting this ?
so looks like you're over estimating the 1/n^2 series right ?
and the over estimated series is just a geometric series with r = 1/2, so the upper bound is 2... okay got it :)
^_^ yes
now u show me how to prove it with integral test
integral test is tricial
*trivial
\[\large \sum \limits_{n=1}^{\infty} \dfrac{1}{x^p} \text{ converges } \iff \int \limits_1^{\infty } \dfrac{1}{x^p} dx \text{ converges } \]
\[\large \sum \limits_{n=1}^{\infty} \dfrac{1}{x^p} \text{ diverges } \iff \int \limits_1^{\infty } \dfrac{1}{x^p} dx \text{ diverges} \]
just evaluate the integral and analyze
\( \large \int \limits_1^{\infty } \dfrac{1}{x^p} dx = \lim_{x\rightarrow\infty } \dfrac{1}{x^p} -1=-1\)
nice hehehe i more like Real analysis so i try to imply that as much as i can
\[\large \int \limits_{1}^{\infty } \dfrac{1}{x^p}dx = \lim \limits_{t \to \infty } \int \limits_{1}^{t } \dfrac{1}{x^p}dx \]
\(p \ne 0\) : \[\large = \lim \limits_{t \to \infty } ~\dfrac{x^{-p+1}}{-p+1}\Bigg |_1^t \]
\(p \ne 1\) *
yeah lol i was rushing :P
thx !
okay next module is on alternating series, wil post as a separate q
thank you for all the help :)
eshhh -_-
Join our real-time social learning platform and learn together with your friends!