Level 3 — ProductionCalculus III — Sequences & Series

Calculus III — Sequences & Series

45 minutes60 marksprintable — key stays hidden on paper

Level 3 Paper: Production & From-Scratch Derivations

Time limit: 45 minutes
Total marks: 60
Instructions: Show all reasoning. Derivations must be built from scratch — state theorems you invoke. Use ...... / ...... for mathematics.


Question 1 — Geometric series, from scratch [10 marks]

(a) Let Sn=k=0n1arkS_n = \sum_{k=0}^{n-1} ar^k. Derive a closed form for SnS_n (for r1r\neq 1) from scratch, then prove that the infinite series k=0ark\sum_{k=0}^{\infty} ar^k converges iff r<1|r|<1, stating its sum. [6]

(b) Using only the geometric-series result, evaluate n=13n+2n6n\displaystyle\sum_{n=1}^{\infty}\frac{3^{\,n}+2^{\,n}}{6^{\,n}}. [4]


Question 2 — Integral test & p-series [12 marks]

(a) State and prove the Integral Test: if ff is positive, continuous and decreasing on [1,)[1,\infty) with an=f(n)a_n=f(n), then an\sum a_n and 1fdx\int_1^\infty f\,dx converge or diverge together. Use the comparison of the series with rectangle areas. [7]

(b) Deduce completely for which real pp the p-series n=1np\sum_{n=1}^\infty n^{-p} converges. Show the boundary case p=1p=1 explicitly. [5]


Question 3 — Telescoping & partial sums [8 marks]

Consider n=11n(n+2)\displaystyle\sum_{n=1}^{\infty}\frac{1}{n(n+2)}.

(a) Use partial fractions to write the general term, find the partial sum SNS_N in closed form, and evaluate the series. [6]

(b) State why computing limNSN\lim_{N\to\infty}S_N (rather than liman\lim a_n) is essential here. [2]


Question 4 — Alternating series, absolute vs conditional [12 marks]

(a) State and prove the Leibniz (Alternating Series) Test, including the error bound SSNaN+1|S-S_N|\le a_{N+1}. [7]

(b) For n=1(1)n+1n\displaystyle\sum_{n=1}^{\infty}\frac{(-1)^{n+1}}{n}, classify as absolutely convergent, conditionally convergent, or divergent, with justification. [3]

(c) How many terms are needed to approximate the sum in (b) to within 0.010.01? [2]


Question 5 — Maclaurin series, derive from memory [10 marks]

(a) Derive the Maclaurin series of ln(1+x)\ln(1+x) from scratch (via term-by-term integration of a geometric series), and state its interval of convergence. [6]

(b) Using known Maclaurin series, evaluate limx0ex1x1cosx.\lim_{x\to 0}\frac{e^{x}-1-x}{1-\cos x}. [4]


Question 6 — Power series & tests [8 marks]

For n=1(x2)nn3n\displaystyle\sum_{n=1}^{\infty}\frac{(x-2)^{n}}{n\,3^{n}}:

(a) Find the radius and interval of convergence, testing both endpoints. [6]

(b) Name the test you used for RR and state its key limitation. [2]

Answer keyMark scheme & solutions

Question 1

(a) [6] Write Sn=a+ar++arn1S_n = a + ar + \dots + ar^{n-1}. Multiply by rr: rSn=ar+ar2++arn.rS_n = ar + ar^2 + \dots + ar^{n}. Subtract: SnrSn=aarnS_n - rS_n = a - ar^n, so Sn=a(1rn)1r(r1).  [2]S_n = \frac{a(1-r^n)}{1-r}\quad (r\neq1).\;\text{[2]} Convergence: as nn\to\infty, rn0r^n\to 0 iff r<1|r|<1; then Sna1rS_n\to \dfrac{a}{1-r}. [2] If r>1|r|>1, rn|r^n|\to\infty (diverges); if r=1r=1, Sn=na±S_n=na\to\pm\infty; if r=1r=-1, SnS_n oscillates a,0,a,0,a,0,a,0,\dots — no limit. Hence convergence iff r<1|r|<1 with sum a1r\frac{a}{1-r}. [2]

(b) [4] n=13n+2n6n=(12)n+(13)n.\sum_{n=1}^\infty\frac{3^n+2^n}{6^n}=\sum\left(\tfrac{1}{2}\right)^n+\sum\left(\tfrac{1}{3}\right)^n. [2] Each geometric with first term = ratio: 1/211/2+1/311/3=1+12=32.  [2]\frac{1/2}{1-1/2}+\frac{1/3}{1-1/3}=1+\frac12=\frac32.\;\text{[2]}


Question 2

(a) [7] Since ff decreasing, on [k,k+1][k,k+1]: f(k+1)f(x)f(k)f(k+1)\le f(x)\le f(k). Integrating over [k,k+1][k,k+1]: ak+1kk+1fdxak.  [3]a_{k+1}\le \int_k^{k+1} f\,dx \le a_k. \;\text{[3]} Summing k=1k=1 to n1n-1: k=2nak1nfdxk=1n1ak.  [2]\sum_{k=2}^{n} a_k \le \int_1^{n} f\,dx \le \sum_{k=1}^{n-1} a_k. \;\text{[2]} If 1f\int_1^\infty f converges, the partial sums k=2nak\sum_{k=2}^n a_k are bounded above and increasing ⇒ series converges. If \int diverges, 1nf\int_1^n f\to\infty forces k=1n1ak\sum_{k=1}^{n-1}a_k\to\infty ⇒ series diverges. Both directions established. [2]

(b) [5] Take f(x)=xpf(x)=x^{-p}, positive/continuous/decreasing for p>0p>0. 1xpdx={1p1p>1p1.  [2]\int_1^\infty x^{-p}dx=\begin{cases}\dfrac{1}{p-1}& p>1\\ \infty & p\le1.\end{cases}\;\text{[2]} For p0p\le 0, an↛0a_n\not\to0 ⇒ diverges by divergence test. So converges iff p>1p>1. [2] Boundary p=1p=1: 1n1xdx=lnn\int_1^n \frac1x dx=\ln n\to\infty, so harmonic series diverges. [1]


Question 3

(a) [6] 1n(n+2)=12(1n1n+2).\dfrac{1}{n(n+2)}=\dfrac12\left(\dfrac1n-\dfrac1{n+2}\right). [2] SN=12n=1N(1n1n+2)=12(1+121N+11N+2).  [3]S_N=\frac12\sum_{n=1}^N\left(\frac1n-\frac1{n+2}\right)=\frac12\left(1+\frac12-\frac1{N+1}-\frac1{N+2}\right).\;\text{[3]} As NN\to\infty: SN1232=34.S_N\to\frac12\cdot\frac32=\frac34. [1]

(b) [2] an0a_n\to0 only tells us the divergence test is inconclusive; convergence requires the partial sums to have a limit, which telescoping gives directly. [2]


Question 4

(a) [7] Given an>0a_n>0, ana_n decreasing, an0a_n\to0, consider SN=(1)n+1anS_N=\sum(-1)^{n+1}a_n. Even partial sums: S2m+2S2m=a2m+1a2m+20S_{2m+2}-S_{2m}=a_{2m+1}-a_{2m+2}\ge0{S2m}\{S_{2m}\} increasing. [2] Odd: S2m+1S2m1=a2m+a2m+10S_{2m+1}-S_{2m-1}=-a_{2m}+a_{2m+1}\le0{S2m1}\{S_{2m-1}\} decreasing. [1] Also S2m=S2m1a2mS2m1S_{2m}=S_{2m-1}-a_{2m}\le S_{2m-1}, so even sums bounded above, odd below; both monotone-bounded ⇒ converge. Since S2m+1S2m=a2m+10S_{2m+1}-S_{2m}=a_{2m+1}\to0, common limit SS. [2] Error: SS lies between consecutive partial sums, so SSNSN+1SN=aN+1|S-S_N|\le|S_{N+1}-S_N|=a_{N+1}. [2]

(b) [3] (1)n+1n\sum\frac{(-1)^{n+1}}{n}: satisfies Leibniz (1/n01/n\downarrow0) ⇒ converges. But 1n\sum\frac1n diverges (harmonic). Hence conditionally convergent. [3]

(c) [2] Need aN+1=1N+10.01a_{N+1}=\frac{1}{N+1}\le0.01N+1100N+1\ge100N99N\ge99. So 99 terms. [2]


Question 5

(a) [6] Start with 11+t=n=0(1)ntn\frac{1}{1+t}=\sum_{n=0}^\infty(-1)^n t^n, t<1|t|<1. [2] Integrate from 00 to xx (valid termwise within radius): ln(1+x)=0xdt1+t=n=0(1)nxn+1n+1=xx22+x33.  [3]\ln(1+x)=\int_0^x\frac{dt}{1+t}=\sum_{n=0}^\infty(-1)^n\frac{x^{n+1}}{n+1}=x-\frac{x^2}{2}+\frac{x^3}{3}-\cdots.\;\text{[3]} Interval of convergence: (1,1](-1,1] (converges at x=1x=1 by Leibniz, diverges at x=1x=-1 → harmonic). [1]

(b) [4] ex1x=x22+x36+e^x-1-x=\frac{x^2}{2}+\frac{x^3}{6}+\cdots; 1cosx=x22x424+1-\cos x=\frac{x^2}{2}-\frac{x^4}{24}+\cdots. [2] x2/2+O(x3)x2/2+O(x4)1.  [2]\frac{x^2/2+O(x^3)}{x^2/2+O(x^4)}\to 1.\;\text{[2]}


Question 6

(a) [6] Ratio test: (x2)n+1/((n+1)3n+1)(x2)n/(n3n)=nn+1x23x23.\left|\frac{(x-2)^{n+1}/((n+1)3^{n+1})}{(x-2)^n/(n3^n)}\right|=\frac{n}{n+1}\cdot\frac{|x-2|}{3}\to\frac{|x-2|}{3}. [2] Converges for x2<3|x-2|<3R=3R=3, interval kernel (1,5)(-1,5). [2] Endpoints: x=5x=5: 1n\sum\frac1n diverges. x=1x=-1: (1)nn\sum\frac{(-1)^n}{n} converges (Leibniz). Interval [1,5)[-1,5). [2]

(b) [2] Ratio test. Limitation: inconclusive when the limit =1=1 (e.g. at endpoints / p-series), requiring separate analysis. [2]


[
{"claim":"Q1b sum = 3/2","code":"n=symbols('n'); s=summation(Rational(1,2)**n,(n,1,oo))+summation(Rational(1,3)**n,(n,1,oo)); result = (s==Rational(3,2))"},
{"claim":"Q3 telescoping series sum = 3/4","code":"n=symbols('n'); s=summation(1/(n*(n+2)),(n,1,oo)); result = (s==Rational(3,4))"},
{"claim":"Q4c need 99 terms for 1/(N+1)<=0.01","code":"N=99; result = (Rational(1,N+1)<=Rational(1,100)) and (Rational(1,N)>Rational(1,100))"},
{"claim":"Q5b limit equals 1","code":"x=symbols('x'); L=limit((exp(x)-1-x)/(1-cos(x)),x,0); result = (L==1)"},
{"claim":"Q6 radius R=3","code":"x=symbols('x'); r=limit((x/(x+1))*Rational(1,3),x,oo); result = (Rational(1,3)*3==1) and (r==Rational(1,3))"}
]