Skip to main content

Sequences and Series

Sequences and series are fundamental to the DSE compulsory maths syllabus. A sequence is an ordered list of numbers governed by a rule; a series is the sum of the terms of a sequence. This topic covers arithmetic and geometric progressions, sigma notation manipulation, and recurrence relations.

Notations and Definitions

Sequences

A sequence is a function a:{N}{R}a: \mathbb{'\{'}N{'\}'} \to \mathbb{'\{'}R{'\}'} (or a subset of {N}\mathbb{'\{'}N{'\}'}). We write the sequence as a1,a2,a3,a_1, a_2, a_3, \ldots, or simply {an}\{a_n\}. Each ana_n is called a term of the sequence. The expression ana_n giving the nn-th term in terms of nn is the general term or formula for the nn-th term.

Series

A series is the sum of the terms of a sequence:

Sn=a1+a2++anS_n = a_1 + a_2 + \cdots + a_n

SnS_n is called the nn-th partial sum. If the sequence of partial sums {Sn}\{S_n\} converges to a limit SS as nn \to \infty, we write S=n=1anS = \sum_{n=1}^{\infty} a_n and call SS the sum to infinity.

Sigma Notation

k=1nak=a1+a2++an\sum_{k=1}^{n} a_k = a_1 + a_2 + \cdots + a_n

The variable kk is the index of summation (a dummy variable -- its name does not matter). The value below is the lower limit; the value above is the upper limit.


Arithmetic Sequences

Geometric Series: Partial Sums

Adjust the parameters in the graph above to explore the relationships between variables.

Definition

An arithmetic sequence (or arithmetic progression, AP) is a sequence where the difference between consecutive terms is constant. This constant difference is denoted dd:

an+1an=dforallna_{n+1} - a_n = d \quad \mathrm{for all } n

The first term is a1a_1. The sequence is: a1,  a1+d,  a1+2d,  a_1, \; a_1 + d, \; a_1 + 2d, \; \ldots

The nn-th Term

Theorem. For an arithmetic sequence with first term a1a_1 and common difference dd:

an=a1+(n1)da_n = a_1 + (n-1)d

Proof (by induction).

  • Base case (n=1n=1): a1=a1+(11)d=a1a_1 = a_1 + (1-1)d = a_1. True.
  • Inductive step: Assume ak=a1+(k1)da_k = a_1 + (k-1)d for some k1k \geq 1. Then
ak+1=ak+d=a1+(k1)d+d=a1+kda_{k+1} = a_k + d = a_1 + (k-1)d + d = a_1 + kd

which matches the formula for n=k+1n = k+1. \blacksquare

Details

Example Find the 20th term of the sequence 3,7,11,15,3, 7, 11, 15, \ldots

Here a1=3a_1 = 3, d=4d = 4. So a20=3+19×4=3+76=79a_{20} = 3 + 19 \times 4 = 3 + 76 = 79.

Details

Example In an arithmetic sequence, a5=17a_5 = 17 and a12=38a_{12} = 38. Find a1a_1 and dd.

a5=a1+4d=17a_5 = a_1 + 4d = 17 and a12=a1+11d=38a_{12} = a_1 + 11d = 38.

Subtracting: 7d=21    d=37d = 21 \implies d = 3. Then a1=1712=5a_1 = 17 - 12 = 5.

Property: Equidistant Terms

Theorem. In an arithmetic sequence, terms equidistant from the ends sum to the same constant:

ak+ank+1=a1+anforallk=1,2,,na_k + a_{n-k+1} = a_1 + a_n \quad \mathrm{for all } k = 1, 2, \ldots, n

Proof.

ak+ank+1=[a1+(k1)d]+[a1+(nk)d]=2a1+(n1)d=a1+ana_k + a_{n-k+1} = [a_1 + (k-1)d] + [a_1 + (n-k)d] = 2a_1 + (n-1)d = a_1 + a_n

\blacksquare

This is the structural reason why the arithmetic series sum formula works (pairing terms).


Arithmetic Series

Sum of the First nn Terms

Theorem. For an arithmetic sequence,

Sn=n2(a1+an)=n2[2a1+(n1)d]S_n = \frac{n}{2}(a_1 + a_n) = \frac{n}{2}[2a_1 + (n-1)d]

Proof (pairing equidistant terms).

Write the sum forwards and backwards:

Sn=a1+a2++anSn=an+an1++a1\begin{aligned} S_n &= a_1 + a_2 + \cdots + a_n \\ S_n &= a_n + a_{n-1} + \cdots + a_1 \end{aligned}

Adding term by term, each pair sums to a1+ana_1 + a_n by the equidistant-terms property. There are nn such pairs:

2Sn=n(a1+an)    Sn=n2(a1+an)2S_n = n(a_1 + a_n) \implies S_n = \frac{n}{2}(a_1 + a_n)

Substituting an=a1+(n1)da_n = a_1 + (n-1)d gives the second form. \blacksquare

Sum of the First nn Positive Integers

Setting a1=1a_1 = 1, d=1d = 1, an=na_n = n:

k=1nk=n(n+1)2\sum_{k=1}^{n} k = \frac{n(n+1)}{2}
Details

Example Find the sum of all integers from 1 to 100.

S100=100×1012=5050S_{100} = \frac{100 \times 101}{2} = 5050.

Details

Example Find the sum of the arithmetic series 2+5+8++892 + 5 + 8 + \cdots + 89.

a1=2a_1 = 2, d=3d = 3. Find nn: an=2+(n1)3=89    3(n1)=87    n=30a_n = 2 + (n-1)3 = 89 \implies 3(n-1) = 87 \implies n = 30.

S30=302(2+89)=15×91=1365S_{30} = \frac{30}{2}(2 + 89) = 15 \times 91 = 1365.


Geometric Sequences

Definition

A geometric sequence (or geometric progression, GP) is a sequence where the ratio of consecutive terms is constant. This constant ratio is denoted rr:

an+1an=rforalln,r0\frac{a_{n+1}}{a_n} = r \quad \mathrm{for all } n, \quad r \neq 0

The sequence is: a1,  a1r,  a1r2,  a_1, \; a_1 r, \; a_1 r^2, \; \ldots

The nn-th Term

Theorem. For a geometric sequence with first term a1a_1 and common ratio rr:

an=a1rn1a_n = a_1 r^{n-1}

Proof (by induction).

  • Base case (n=1n=1): a1=a1r0=a1a_1 = a_1 r^0 = a_1. True.
  • Inductive step: Assume ak=a1rk1a_k = a_1 r^{k-1}. Then
ak+1=akr=a1rk1r=a1rka_{k+1} = a_k \cdot r = a_1 r^{k-1} \cdot r = a_1 r^k

\blacksquare

Details

Example Find the 8th term of 3,6,12,24,3, -6, 12, -24, \ldots

a1=3a_1 = 3, r=2r = -2. a8=3(2)7=3(128)=384a_8 = 3(-2)^7 = 3(-128) = -384.

Details

Example The 3rd term of a GP is 12 and the 7th term is 192. Find a1a_1 and rr.

a3=a1r2=12a_3 = a_1 r^2 = 12 and a7=a1r6=192a_7 = a_1 r^6 = 192.

Dividing: r4=19212=16    r4=16r^4 = \frac{192}{12} = 16 \implies r^4 = 16. Taking the positive root (assuming r>0r \gt 0): r=2r = 2. Then a1=124=3a_1 = \frac{12}{4} = 3.


Geometric Series

Sum of the First nn Terms

Theorem. For a geometric sequence with r1r \neq 1:

Sn=a1(1rn)1rS_n = \frac{a_1(1 - r^n)}{1 - r}

Proof. Write out the sum and multiply by rr:

Sn=a1+a1r+a1r2++a1rn1rSn=a1+a1r+a1r2++a1rn1+a1rn\begin{aligned} S_n &= a_1 + a_1 r + a_1 r^2 + \cdots + a_1 r^{n-1} \\ r S_n &= \phantom{a_1 + }\, a_1 r + a_1 r^2 + \cdots + a_1 r^{n-1} + a_1 r^n \end{aligned}

Subtracting: (1r)Sn=a1a1rn=a1(1rn)(1-r)S_n = a_1 - a_1 r^n = a_1(1 - r^n).

Sn=a1(1rn)1rS_n = \frac{a_1(1 - r^n)}{1 - r}

\blacksquare

For r=1r = 1, the sequence is constant and Sn=na1S_n = n a_1.

Sum to Infinity

Theorem. If r<1|r| \lt 1, then:

S=n=1a1rn1=a11rS_\infty = \sum_{n=1}^{\infty} a_1 r^{n-1} = \frac{a_1}{1 - r}

Proof. Since r<1|r| \lt 1, we have limnrn=0\lim_{n \to \infty} r^n = 0. Applying this to the finite sum formula:

S=limna1(1rn)1r=a1(10)1r=a11rS_\infty = \lim_{n \to \infty} \frac{a_1(1 - r^n)}{1 - r} = \frac{a_1(1 - 0)}{1 - r} = \frac{a_1}{1 - r}

\blacksquare

If r1|r| \geq 1, the terms do not approach zero, so the series diverges.

Applications

Details

Repeating decimals Express 0.370.\overline{37} as a fraction.

0.37=0.37+0.0037+0.000037+0.\overline{37} = 0.37 + 0.0037 + 0.000037 + \cdots

This is a geometric series with a=0.37a = 0.37, r=0.01r = 0.01.

S=0.3710.01=0.370.99=3799S_\infty = \frac{0.37}{1 - 0.01} = \frac{0.37}{0.99} = \frac{37}{99}.

Details

Example: Compound interest A principal of USD 5000 is invested at 4% per annum, compounded annually. Find the value after 10 years.

The amount after nn years is 5000(1.04)n5000(1.04)^n.

After 10 years: 5000(1.04)105000(1.48024)7401.225000(1.04)^{10} \approx 5000(1.48024) \approx 7401.22.

Details

Example: Bouncing ball A ball is dropped from 8 m. After each bounce it reaches 60% of the previous height. Find the total vertical distance travelled.

Down: 8 m. Up and down repeatedly: 2×8(0.6),  2×8(0.6)2,  2 \times 8(0.6), \; 2 \times 8(0.6)^2, \; \ldots

Total distance =8+2×8n=1(0.6)n=8+160.610.6=8+161.5=8+24=32= 8 + 2 \times 8 \sum_{n=1}^{\infty} (0.6)^n = 8 + 16 \cdot \frac{0.6}{1-0.6} = 8 + 16 \cdot 1.5 = 8 + 24 = 32 m.


Sigma Notation Manipulation

Linearity

Sigma notation is linear:

k=1n(ak+bk)=k=1nak+k=1nbk\sum_{k=1}^{n} (a_k + b_k) = \sum_{k=1}^{n} a_k + \sum_{k=1}^{n} b_k k=1ncak=ck=1nak\sum_{k=1}^{n} c \cdot a_k = c \sum_{k=1}^{n} a_k

where cc is a constant (does not depend on kk).

Index Shifting

The index variable is a dummy. We can shift it:

k=mnak=k=m+1n+1ak1=j=0nmaj+m\sum_{k=m}^{n} a_k = \sum_{k=m+1}^{n+1} a_{k-1} = \sum_{j=0}^{n-m} a_{j+m}

This is essential for re-indexing series to match known formulas.

Standard Sums

k=1n1=n,k=1nk=n(n+1)2,k=1nk2=n(n+1)(2n+1)6\sum_{k=1}^{n} 1 = n, \qquad \sum_{k=1}^{n} k = \frac{n(n+1)}{2}, \qquad \sum_{k=1}^{n} k^2 = \frac{n(n+1)(2n+1)}{6}
Details

Example Evaluate k=310(2k1)\sum_{k=3}^{10} (2k - 1).

k=310(2k1)=2k=310kk=3101\sum_{k=3}^{10} (2k-1) = 2\sum_{k=3}^{10} k - \sum_{k=3}^{10} 1

=2(k=110kk=12k)(103+1)= 2\left(\sum_{k=1}^{10} k - \sum_{k=1}^{2} k\right) - (10 - 3 + 1)

=2(553)8=2(52)8=1048=96= 2(55 - 3) - 8 = 2(52) - 8 = 104 - 8 = 96.

Details

Example Evaluate k=1n(3k25k+2)\sum_{k=1}^{n} (3k^2 - 5k + 2).

=3k=1nk25k=1nk+2k=1n1= 3\sum_{k=1}^{n} k^2 - 5\sum_{k=1}^{n} k + 2\sum_{k=1}^{n} 1

=3n(n+1)(2n+1)65n(n+1)2+2n= 3 \cdot \frac{n(n+1)(2n+1)}{6} - 5 \cdot \frac{n(n+1)}{2} + 2n

=n(n+1)(2n+1)25n(n+1)2+2n= \frac{n(n+1)(2n+1)}{2} - \frac{5n(n+1)}{2} + 2n

=n2[(n+1)(2n+15)+4]=n2[(n+1)(2n4)+4]= \frac{n}{2}[(n+1)(2n+1-5) + 4] = \frac{n}{2}[(n+1)(2n-4) + 4]

=n2[2n22n4+4]=n2(2n22n)=n2(n1)= \frac{n}{2}[2n^2 - 2n - 4 + 4] = \frac{n}{2}(2n^2 - 2n) = n^2(n - 1).


Recurrence Relations

Definition

A recurrence relation defines each term of a sequence in terms of preceding terms. The simplest form is a first-order recurrence:

an+1=f(an),a1givena_{n+1} = f(a_n), \quad a_1 \mathrm{ given}

Arithmetic and geometric sequences are special cases:

  • Arithmetic: an+1=an+da_{n+1} = a_n + d (linear, constant increment)
  • Geometric: an+1=rana_{n+1} = r \cdot a_n (linear, proportional)

Finding the Limit: Fixed Point Method

If a sequence defined by an+1=f(an)a_{n+1} = f(a_n) converges to a limit LL, then LL must satisfy:

L=f(L)L = f(L)

This equation gives the fixed point(s) of ff. To confirm convergence, one must also show the sequence is bounded and monotonic (or use other convergence criteria).

Details

Example A sequence is defined by an+1=12(an+16an)a_{n+1} = \frac{1}{2}\left(a_n + \frac{16}{a_n}\right) with a1=1a_1 = 1. Find its limit.

Set L=12(L+16L)L = \frac{1}{2}\left(L + \frac{16}{L}\right).

2L=L+16L    L=16L    L2=162L = L + \frac{16}{L} \implies L = \frac{16}{L} \implies L^2 = 16.

Since an>0a_n \gt 0 for all nn, L=4L = 4.

This is the Babylonian method for computing 16=4\sqrt{16} = 4.

Details

Example A sequence is defined by an+1=2+ana_{n+1} = \sqrt{2 + a_n} with a1=2a_1 = \sqrt{2}. Assuming convergence, find the limit.

L=2+L    L2=2+L    L2L2=0    (L2)(L+1)=0L = \sqrt{2 + L} \implies L^2 = 2 + L \implies L^2 - L - 2 = 0 \implies (L-2)(L+1) = 0.

Since an>0a_n \gt 0, L=2L = 2.


Common Pitfalls

  • Confusing ana_n and SnS_n. ana_n is a single term; SnS_n is the sum up to that term. Read the question carefully.
  • Off-by-one errors in the nn-th term formula. The formula is an=a1+(n1)da_n = a_1 + (n-1)d, not a1+nda_1 + nd. The exponent in the geometric formula is rn1r^{n-1}, not rnr^n.
  • Forgetting the convergence condition for infinite series. S=a11rS_\infty = \frac{a_1}{1-r} is only valid when r<1|r| \lt 1. If r1|r| \geq 1, the sum does not exist.
  • Mixing up the common ratio and common difference. dd is for arithmetic (difference), rr is for geometric (ratio).
  • Sigma notation index errors. When shifting indices, verify by checking the first and last terms. k=1nakk=0nak\sum_{k=1}^{n} a_k \neq \sum_{k=0}^{n} a_k in general.
  • Assuming a recurrence converges without justification. Setting L=f(L)L = f(L) gives candidate limits. You still need to verify the sequence actually converges (e.g., via the Monotone Convergence Theorem).
  • Arithmetic series formula with wrong nn. If asked to sum from a3a_3 to a10a_{10}, the number of terms is 103+1=810 - 3 + 1 = 8, not 10 or 7.

Wrap-up Questions

Wrap-up Questions
  1. Question: A student starts a savings plan. In the first year, they deposit USD 1,200. In each subsequent year, they increase their deposit by a constant USD 300. After 5 years of deposits, they stop adding money and invest the total accumulated amount in an account that earns 6% interest compounded annually. What is the value of the investment 10 years after they made their last deposit?
Answer
  • This is a two-part problem. First, an arithmetic series to find the total saved, then a geometric sequence for the compound interest.
  • Part 1: Calculate total savings (Arithmetic Series)
    • The deposits are an arithmetic sequence with a1=1200a_1 = 1200, d=300d = 300, and n=5n=5 years of deposits.
    • The total amount deposited is the sum of the series, S5S_5.
    • First, find the deposit in the 5th year: a5=a1+(51)d=1200+4(300)=2400a_5 = a_1 + (5-1)d = 1200 + 4(300) = 2400.
    • Now, find the sum: S5=n2(a1+a5)=52(1200+2400)=2.5(3600)=USD9,000S_5 = \frac{n}{2}(a_1 + a_5) = \frac{5}{2}(1200 + 2400) = 2.5(3600) = \mathrm{USD } 9,000.
  • Part 2: Calculate investment growth (Geometric Sequence)
    • The principal for the investment is P=USD9,000P = \mathrm{USD } 9,000.
    • The annual interest rate is i=0.06i = 0.06, so the common ratio is r=1.06r = 1.06.
    • The time period is t=10t = 10 years.
    • The future value is given by the compound interest formula FV=P(1+i)tFV = P(1+i)^t.
    • FV=9000(1.06)109000(1.790847)USD16,117.62FV = 9000(1.06)^{10} \approx 9000(1.790847) \approx \mathrm{USD } 16,117.62.

If you get this wrong, you should focus on: Separating a multi-stage problem, calculating the sum of a finite arithmetic series, and applying the formula for compound interest (a geometric sequence application).

  1. Question: A patient is given an initial dose of 20mg of a medication. Every day, they take a 10mg maintenance dose. The drug is eliminated from the body such that 50% of the total amount is removed every 24 hours. What is the limiting amount of the drug in the body in the long run (i.e., the steady state amount)?
Answer
  • Let AnA_n be the amount of the drug in the body immediately after the nn-th maintenance dose.
  • A0=20A_0 = 20 (initial dose).
  • Day 1: Before the dose, the amount is 20×0.5=1020 \times 0.5 = 10. After the dose, A1=(20×0.5)+10=20A_1 = (20 \times 0.5) + 10 = 20.
  • Day 2: Before the dose, the amount is A1×0.5=20×0.5=10A_1 \times 0.5 = 20 \times 0.5 = 10. After the dose, A2=(A1×0.5)+10=(20×0.5)+10=20A_2 = (A_1 \times 0.5) + 10 = (20 \times 0.5) + 10 = 20.
  • It seems the amount right after each dose is always 20mg. Let's write a general recurrence relation.
  • Let QnQ_n be the amount in the body just after the nn-th dose (for n1n \ge 1). Let Q0=20Q_0=20 be the initial amount.
  • The amount just before the (n+1)(n+1)-th dose is 0.5Qn0.5 \cdot Q_n.
  • The amount just after the (n+1)(n+1)-th dose is Qn+1=0.5Qn+10Q_{n+1} = 0.5 \cdot Q_n + 10.
  • To find the limiting amount (steady state), we assume the sequence converges to a limit LL.
  • As nn \to \infty, Qn+1LQ_{n+1} \to L and QnLQ_n \to L. L=0.5L+10L = 0.5L + 10 0.5L=100.5L = 10 L=100.5=20mgL = \frac{10}{0.5} = 20 \mathrm{ mg}
  • The limiting amount of the drug in the body, measured just after taking the dose, is 20 mg. The amount will then fluctuate between 20mg (just after the dose) and 10mg (just before the next dose). The question asks for the limiting amount, which in this context usually refers to the peak steady-state level.

If you get this wrong, you should focus on: Modeling real-world scenarios with recurrence relations and finding the fixed point or steady state of the system by taking the limit.

  1. Question: Find the exact sum of the infinite series n=11n(n+1)(n+2)\sum_{n=1}^{\infty} \frac{1}{n(n+1)(n+2)}.
Answer
  • This series can be solved by recognizing it as a telescoping series after applying partial fraction decomposition.
  • Step 1: Decompose the general term.
    • 1n(n+1)(n+2)=An+Bn+1+Cn+2\frac{1}{n(n+1)(n+2)} = \frac{A}{n} + \frac{B}{n+1} + \frac{C}{n+2}
    • 1=A(n+1)(n+2)+B(n)(n+2)+C(n)(n+1)1 = A(n+1)(n+2) + B(n)(n+2) + C(n)(n+1)
    • Let n=0n=0: 1=A(1)(2)    A=1/21 = A(1)(2) \implies A = 1/2.
    • Let n=1n=-1: 1=B(1)(1)    B=11 = B(-1)(1) \implies B = -1.
    • Let n=2n=-2: 1=C(2)(1)    C=1/21 = C(-2)(-1) \implies C = 1/2. So, the term is 12n1n+1+12(n+2)\frac{1}{2n} - \frac{1}{n+1} + \frac{1}{2(n+2)}.
  • Step 2: Write out the partial sum SNS_N to find the pattern.
    • To make the pattern clearer, rewrite the term as 12(1n2n+1+1n+2)=12[(1n1n+1)(1n+11n+2)]\frac{1}{2}\left(\frac{1}{n} - \frac{2}{n+1} + \frac{1}{n+2}\right) = \frac{1}{2}\left[\left(\frac{1}{n} - \frac{1}{n+1}\right) - \left(\frac{1}{n+1} - \frac{1}{n+2}\right)\right].
    • Let an=1n1n+1a_n = \frac{1}{n} - \frac{1}{n+1}. The term is 12(anan+1)\frac{1}{2}(a_n - a_{n+1}).
    • n=1:12(a1a2)=12[(112)(1213)]n=1: \frac{1}{2}(a_1 - a_2) = \frac{1}{2}\left[\left(1-\frac{1}{2}\right) - \left(\frac{1}{2}-\frac{1}{3}\right)\right]
    • n=2:12(a2a3)=12[(1213)(1314)]n=2: \frac{1}{2}(a_2 - a_3) = \frac{1}{2}\left[\left(\frac{1}{2}-\frac{1}{3}\right) - \left(\frac{1}{3}-\frac{1}{4}\right)\right]
    • n=3:12(a3a4)=12[(1314)(1415)]n=3: \frac{1}{2}(a_3 - a_4) = \frac{1}{2}\left[\left(\frac{1}{3}-\frac{1}{4}\right) - \left(\frac{1}{4}-\frac{1}{5}\right)\right]
    • The sum is 12[(a1a2)+(a2a3)++(aNaN+1)]\frac{1}{2} [ (a_1 - a_2) + (a_2 - a_3) + \dots + (a_N - a_{N+1}) ].
    • This telescopes to 12(a1aN+1)\frac{1}{2}(a_1 - a_{N+1}).
  • Step 3: Evaluate the limit of the partial sum.
    • SN=12(a1aN+1)=12[121N+1+1N+2]S_N = \frac{1}{2}(a_1 - a_{N+1}) = \frac{1}{2}\left[ \frac{1}{2} - \frac{1}{N+1} + \frac{1}{N+2} \right]
    • S=limNSN=limN12[121N+1+1N+2]=12(120+0)=14S = \lim_{N\to\infty} S_N = \lim_{N\to\infty} \frac{1}{2}\left[ \frac{1}{2} - \frac{1}{N+1} + \frac{1}{N+2} \right] = \frac{1}{2} \left( \frac{1}{2} - 0 + 0 \right) = \frac{1}{4}

If you get this wrong, you should focus on: Partial fraction decomposition for cubic denominators and identifying the cancellation pattern in telescoping series.

  1. Question: The area of a Koch snowflake can be found by summing an infinite series. Start with an equilateral triangle of area AA. At each step, a new equilateral triangle is added to the middle third of each existing side. The new triangle's side length is 1/3 of the side it's added to. Find the total area of the snowflake after an infinite number of steps in terms of the initial area AA.
Answer
  • This problem requires tracking the number of triangles added and their area at each step.
  • Let A0=AA_0 = A be the initial area. Let S0=3S_0 = 3 be the initial number of sides.
  • Step 1 (k=1):
    • We add one new triangle to each of the S0=3S_0=3 sides.
    • A triangle with side length s/3s/3 has area (1/3)2=1/9(1/3)^2 = 1/9 of a triangle with side length ss.
    • Area added: A1=S0A9=3A9=A3A_1 = S_0 \cdot \frac{A}{9} = 3 \cdot \frac{A}{9} = \frac{A}{3}.
    • New number of sides: S1=S04=12S_1 = S_0 \cdot 4 = 12.
  • Step 2 (k=2):
    • We add one new triangle to each of the S1=12S_1=12 sides.
    • The side length of these new triangles is 1/31/3 of the previous step's triangles, so their area is 1/91/9 of the previous step's triangles, which is (1/9)2A=A/81(1/9)^2 A = A/81.
    • Area added: A2=S1A81=12A81=4A27A_2 = S_1 \cdot \frac{A}{81} = 12 \cdot \frac{A}{81} = \frac{4A}{27}.
  • Step 3 (k=3):
    • Number of sides is now S2=S14=48S_2 = S_1 \cdot 4 = 48. Area of new triangles is A/811/9=A/729A/81 \cdot 1/9 = A/729.
    • Area added: A3=S2A729=48A729=16A243A_3 = S_2 \cdot \frac{A}{729} = 48 \cdot \frac{A}{729} = \frac{16A}{243}.
  • Identify the pattern:
    • The total area is Atotal=A0+A1+A2+A3+A_{total} = A_0 + A_1 + A_2 + A_3 + \dots
    • Atotal=A+A3+4A27+16A243+=A+A(13+427+16243+)A_{total} = A + \frac{A}{3} + \frac{4A}{27} + \frac{16A}{243} + \dots = A + A \left( \frac{1}{3} + \frac{4}{27} + \frac{16}{243} + \dots \right)
    • The series in the parenthesis is 13+4913+(49)213+\frac{1}{3} + \frac{4}{9} \cdot \frac{1}{3} + \left(\frac{4}{9}\right)^2 \cdot \frac{1}{3} + \dots
    • This is a geometric series with first term a=1/3a = 1/3 and common ratio r=4/9r = 4/9.
  • Sum the series:
    • Since r=4/9<1|r| = 4/9 \lt 1, the series converges.
    • Sum of the added area = a1r=1/314/9=1/35/9=1395=35\frac{a}{1-r} = \frac{1/3}{1 - 4/9} = \frac{1/3}{5/9} = \frac{1}{3} \cdot \frac{9}{5} = \frac{3}{5}.
    • The total area is Atotal=A+A(35)=85AA_{total} = A + A \left( \frac{3}{5} \right) = \frac{8}{5}A.

If you get this wrong, you should focus on: Modeling a geometric process, identifying the first term and common ratio of the resulting geometric series, and calculating the sum.

  1. Question: A student is trying to determine if the series n=1n2+nn3+2\sum_{n=1}^{\infty} \frac{n^2+n}{n^3+2} converges. They first try the Ratio Test, but find it inconclusive. Show why the Ratio Test is inconclusive, and then use a more appropriate test to definitively determine convergence or divergence.
Answer
  • Part 1: Show the Ratio Test is inconclusive.
    • Let an=n2+nn3+2a_n = \frac{n^2+n}{n^3+2}. L=limnan+1an=limn(n+1)2+(n+1)(n+1)3+2n3+2n2+nL = \lim_{n\to\infty} \left| \frac{a_{n+1}}{a_n} \right| = \lim_{n\to\infty} \frac{(n+1)^2+(n+1)}{(n+1)^3+2} \cdot \frac{n^3+2}{n^2+n}
    • To evaluate this limit, we only need to consider the highest power terms in each polynomial.
    • Highest power in (n+1)2+(n+1)(n+1)^2+(n+1) is n2n^2.
    • Highest power in (n+1)3+2(n+1)^3+2 is n3n^3.
    • Highest power in n3+2n^3+2 is n3n^3.
    • Highest power in n2+nn^2+n is n2n^2. L=limnn2n3n3n2=limnn5n5=1L = \lim_{n\to\infty} \frac{n^2 \cdot n^3}{n^3 \cdot n^2} = \lim_{n\to\infty} \frac{n^5}{n^5} = 1
    • Since the limit is 1, the Ratio Test is inconclusive.
  • Part 2: Use a more appropriate test.
    • The Limit Comparison Test is ideal here. The term ana_n behaves like n2n3=1n\frac{n^2}{n^3} = \frac{1}{n} for large nn.
    • Let's compare our series to the harmonic series bn=1n\sum b_n = \sum \frac{1}{n}, which is known to diverge.
    • Compute the limit of the ratio of the terms: L=limnanbn=limnn2+nn3+21n=limnn(n2+n)n3+2=limnn3+n2n3+2L = \lim_{n\to\infty} \frac{a_n}{b_n} = \lim_{n\to\infty} \frac{\frac{n^2+n}{n^3+2}}{\frac{1}{n}} = \lim_{n\to\infty} \frac{n(n^2+n)}{n^3+2} = \lim_{n\to\infty} \frac{n^3+n^2}{n^3+2}
    • Divide numerator and denominator by n3n^3: L=limn1+1/n1+2/n3=11=1L = \lim_{n\to\infty} \frac{1+1/n}{1+2/n^3} = \frac{1}{1} = 1
    • Since the limit is a finite, positive number (0<L<0 \lt L \lt \infty), and the comparison series 1n\sum \frac{1}{n} diverges, the original series n2+nn3+2\sum \frac{n^2+n}{n^3+2} also diverges by the Limit Comparison Test.

If you get this wrong, you should focus on: Understanding the limitations of the Ratio Test (especially for rational functions) and applying the Limit Comparison Test by choosing an appropriate p-series to compare with.

  1. Question: A programmer needs to approximate cos(0.2)\cos(0.2) for a low-power device. They decide to use a Maclaurin polynomial. What is the minimum degree of the polynomial required to guarantee an approximation error less than 10710^{-7}?
Answer
  • This problem requires using the Taylor Remainder Theorem, specifically the error bound for an alternating series, as the Maclaurin series for cosine is alternating.
  • The Maclaurin series for cos(x)\cos(x) is n=0(1)nx2n(2n)!=1x22!+x44!x66!+\sum_{n=0}^{\infty} \frac{(-1)^n x^{2n}}{(2n)!} = 1 - \frac{x^2}{2!} + \frac{x^4}{4!} - \frac{x^6}{6!} + \dots.
  • For x=0.2x=0.2, this is an alternating series. The Alternating Series Estimation Theorem states that the error Rn|R_n| in approximating the sum by the nn-th partial sum is less than the absolute value of the first unused term, an+1|a_{n+1}|.
  • Let's calculate the absolute values of the terms for x=0.2x=0.2:
    • Term 0 (11): Used in P0P_0.
    • Term 1 (0.222!-\frac{0.2^2}{2!}): a1=0.042=0.02|a_1| = \frac{0.04}{2} = 0.02. Used in P2P_2.
    • Term 2 (+0.244!+\frac{0.2^4}{4!}): a2=0.0016246.67×105|a_2| = \frac{0.0016}{24} \approx 6.67 \times 10^{-5}. Used in P4P_4.
    • Term 3 (0.266!-\frac{0.2^6}{6!}): a3=0.0000647208.89×108|a_3| = \frac{0.000064}{720} \approx 8.89 \times 10^{-8}.
  • We need the error to be less than 10710^{-7}.
  • If we use the polynomial P4(x)=1x22!+x44!P_4(x) = 1 - \frac{x^2}{2!} + \frac{x^4}{4!}, the error will be bounded by the absolute value of the next term, which is a38.89×108|a_3| \approx 8.89 \times 10^{-8}.
  • Since 8.89×108<1078.89 \times 10^{-8} \lt 10^{-7}, this is sufficient.
  • The polynomial P4(x)P_4(x) has degree 4. However, the question asks for the minimum degree. The polynomial used is 1x22!+x44!1 - \frac{x^2}{2!} + \frac{x^4}{4!}. The term with x5x^5 is zero, so P5(x)=P4(x)P_5(x) = P_4(x). The error for P5(x)P_5(x) is also bounded by the next non-zero term, which is the x6x^6 term.
  • Therefore, using a polynomial of degree 4 (or 5) is sufficient. The minimum degree required to include the x4x^4 term is 4.

If you get this wrong, you should focus on: The Alternating Series Estimation Theorem and how it applies to Taylor series approximations for functions like sine and cosine.

  1. Question: The function f(x)=sin(x2)f(x) = \sin(x^2) is notoriously difficult to integrate. Approximate the value of the definite integral 01sin(x2)dx\int_0^1 \sin(x^2) dx by integrating the first three non-zero terms of its Maclaurin series.
Answer
  • Step 1: Find the Maclaurin series for sin(x2)\sin(x^2).
    • Start with the series for sin(u)=uu33!+u55!\sin(u) = u - \frac{u^3}{3!} + \frac{u^5}{5!} - \dots.
    • Substitute u=x2u = x^2:
      • sin(x2)=(x2)(x2)33!+(x2)55!=x2x66+x10120\sin(x^2) = (x^2) - \frac{(x^2)^3}{3!} + \frac{(x^2)^5}{5!} - \dots = x^2 - \frac{x^6}{6} + \frac{x^{10}}{120} - \dots
  • Step 2: Integrate the series term-by-term from 0 to 1.
    • 01sin(x2)dx01(x2x66+x10120)dx\int_0^1 \sin(x^2) dx \approx \int_0^1 \left( x^2 - \frac{x^6}{6} + \frac{x^{10}}{120} \right) dx
  • Step 3: Evaluate the integral.
    • [x33x767+x1112011]01\left[ \frac{x^3}{3} - \frac{x^7}{6 \cdot 7} + \frac{x^{11}}{120 \cdot 11} \right]_0^1
    • =(1331742+1111320)(0)= \left( \frac{1^3}{3} - \frac{1^7}{42} + \frac{1^{11}}{1320} \right) - (0)
    • =13142+11320= \frac{1}{3} - \frac{1}{42} + \frac{1}{1320}
  • Step 4: Calculate the final value.
    • 130.333333\frac{1}{3} \approx 0.333333
    • 1420.023810\frac{1}{42} \approx 0.023810
    • 113200.000758\frac{1}{1320} \approx 0.000758
    • Approximation 0.3333330.023810+0.000758=0.310281\approx 0.333333 - 0.023810 + 0.000758 = 0.310281.

If you get this wrong, you should focus on: Creating new series from known Maclaurin series via substitution, and performing term-by-term integration of a power series to approximate a definite integral.

  1. Question: A ball is dropped from a height of 10 meters. After each bounce, it returns to 75% of its previous height. The time it takes to fall from a height hh is h/5\sqrt{h/5} seconds, and the time it takes to rise to a height hh is also h/5\sqrt{h/5} seconds. What is the total time the ball is in the air?
Answer
  • This problem involves summing two different infinite geometric series: one for the distances and one for the time.
  • Step 1: Analyze the sequence of heights.
    • Initial drop: h0=10h_0 = 10.
    • After 1st bounce: h1=10(0.75)h_1 = 10(0.75).
    • After 2nd bounce: h2=10(0.75)2h_2 = 10(0.75)^2.
    • In general, after the nn-th bounce, the height is hn=10(0.75)nh_n = 10(0.75)^n.
  • Step 2: Calculate the time for the initial drop.
    • Tdrop,0=h0/5=10/5=2T_{drop,0} = \sqrt{h_0/5} = \sqrt{10/5} = \sqrt{2} seconds.
  • Step 3: Calculate the time for all subsequent rises and falls.
    • For each bounce nn (starting at n=1n=1), the ball rises to height hnh_n and falls from height hnh_n.
    • Time for one rise-fall cycle from height hnh_n: Tn=Trise+Tfall=hn/5+hn/5=2hn/5T_n = T_{rise} + T_{fall} = \sqrt{h_n/5} + \sqrt{h_n/5} = 2\sqrt{h_n/5}.
    • Tn=210(0.75)n/5=22(0.75)n=22(0.75)nT_n = 2\sqrt{10(0.75)^n / 5} = 2\sqrt{2(0.75)^n} = 2\sqrt{2}(\sqrt{0.75})^n.
  • Step 4: Sum the infinite series for the time of the bounces.
    • Total time for bounces is n=1Tn=n=122(0.75)n\sum_{n=1}^{\infty} T_n = \sum_{n=1}^{\infty} 2\sqrt{2}(\sqrt{0.75})^n.
    • This is a geometric series with first term a=220.75a = 2\sqrt{2}\sqrt{0.75} and common ratio r=0.75r = \sqrt{0.75}.
    • r=3/4=320.866<1r = \sqrt{3/4} = \frac{\sqrt{3}}{2} \approx 0.866 \lt 1, so the series converges.
    • Sum = a1r=220.7510.75=21.510.752(1.2247)10.8662.44940.13418.28\frac{a}{1-r} = \frac{2\sqrt{2}\sqrt{0.75}}{1-\sqrt{0.75}} = \frac{2\sqrt{1.5}}{1-\sqrt{0.75}} \approx \frac{2(1.2247)}{1-0.866} \approx \frac{2.4494}{0.134} \approx 18.28 seconds.
  • Step 5: Calculate total time.
    • Total Time = Initial Drop Time + Bounce Time
    • Total Time = 2+18.281.414+18.28=19.694\sqrt{2} + 18.28 \approx 1.414 + 18.28 = 19.694 seconds.

If you get this wrong, you should focus on: Setting up a model based on a word problem, identifying the correct geometric series (especially the common ratio), and summing an infinite geometric series.

  1. Question: Show that the series n=2(1)nnln(n)\sum_{n=2}^{\infty} \frac{(-1)^n}{\sqrt{n} \ln(n)} is conditionally convergent.
Answer
  • To prove conditional convergence, we must show two things: (1) the series itself converges, and (2) the series of absolute values diverges.
  • Part 1: Show convergence of the original series.
    • We use the Alternating Series Test on n=2(1)nnln(n)\sum_{n=2}^{\infty} \frac{(-1)^n}{\sqrt{n} \ln(n)}. Let bn=1nln(n)b_n = \frac{1}{\sqrt{n} \ln(n)}.
    • Condition 1: bn>0b_n \gt 0 for n2n \ge 2. This is true.
    • Condition 2: limnbn=limn1nln(n)=0\lim_{n\to\infty} b_n = \lim_{n\to\infty} \frac{1}{\sqrt{n} \ln(n)} = 0. This is true as the denominator grows to infinity.
    • Condition 3: bn+1bnb_{n+1} \le b_n. The function f(x)=xln(x)f(x) = \sqrt{x}\ln(x) is a product of two increasing functions, so it is increasing. Therefore, its reciprocal, bnb_n, is decreasing.
    • Since all three conditions are met, the series converges by the Alternating Series Test.
  • Part 2: Show divergence of the series of absolute values.
    • We need to test the series n=2(1)nnln(n)=n=21nln(n)\sum_{n=2}^{\infty} \left| \frac{(-1)^n}{\sqrt{n} \ln(n)} \right| = \sum_{n=2}^{\infty} \frac{1}{\sqrt{n} \ln(n)}.
    • We can use the Direct Comparison Test. We know that for n>en \gt e, ln(n)<n\ln(n) \lt \sqrt{n}.
    • Therefore, nln(n)<nn=n\sqrt{n}\ln(n) \lt \sqrt{n}\sqrt{n} = n.
    • This implies 1nln(n)>1n\frac{1}{\sqrt{n}\ln(n)} \gt \frac{1}{n} for nn large enough.
    • We are comparing our series to the harmonic series 1n\sum \frac{1}{n}, which diverges.
    • Since the terms of our series are greater than the terms of a divergent series, the series 1nln(n)\sum \frac{1}{\sqrt{n} \ln(n)} diverges by the Direct Comparison Test.
  • Conclusion:
    • The series converges, but it does not converge absolutely. Therefore, the series is conditionally convergent.

If you get this wrong, you should focus on: The definition of conditional and absolute convergence, applying the Alternating Series Test, and using the Direct Comparison Test with a suitable bounding function (like comparing ln(n)\ln(n) to a power of nn).

  1. Question: Find the complete interval of convergence for the power series n=1(2x5)nn3n\sum_{n=1}^{\infty} \frac{(2x-5)^n}{n \cdot 3^n}.
Answer
  • Step 1: Use the Ratio Test to find the radius of convergence.
    • Let an=(2x5)nn3na_n = \frac{(2x-5)^n}{n \cdot 3^n}.
    • L=limnan+1an=limn(2x5)n+1(n+1)3n+1n3n(2x5)nL = \lim_{n\to\infty} \left| \frac{a_{n+1}}{a_n} \right| = \lim_{n\to\infty} \left| \frac{(2x-5)^{n+1}}{(n+1)3^{n+1}} \cdot \frac{n \cdot 3^n}{(2x-5)^n} \right|
    • L=limn2x53nn+1=2x53limnnn+1=2x53L = \lim_{n\to\infty} \left| \frac{2x-5}{3} \cdot \frac{n}{n+1} \right| = \frac{|2x-5|}{3} \lim_{n\to\infty} \frac{n}{n+1} = \frac{|2x-5|}{3}
  • Step 2: Solve for the interval where the series converges.
    • The series converges when L<1L \lt 1, so 2x53<1    2x5<3\frac{|2x-5|}{3} \lt 1 \implies |2x-5| \lt 3.
    • This gives 3<2x5<3-3 \lt 2x-5 \lt 3.
    • Add 5 to all parts: 2<2x<82 \lt 2x \lt 8.
    • Divide by 2: 1<x<41 \lt x \lt 4.
  • Step 3: Test the endpoints of the interval.
    • Endpoint x = 4: Substitute into the series:
      • n=1(2(4)5)nn3n=n=13nn3n=n=11n\sum_{n=1}^{\infty} \frac{(2(4)-5)^n}{n \cdot 3^n} = \sum_{n=1}^{\infty} \frac{3^n}{n \cdot 3^n} = \sum_{n=1}^{\infty} \frac{1}{n} This is the harmonic series, which diverges.
    • Endpoint x = 1: Substitute into the series:
      • n=1(2(1)5)nn3n=n=1(3)nn3n=n=1(1)nn\sum_{n=1}^{\infty} \frac{(2(1)-5)^n}{n \cdot 3^n} = \sum_{n=1}^{\infty} \frac{(-3)^n}{n \cdot 3^n} = \sum_{n=1}^{\infty} \frac{(-1)^n}{n} This is the alternating harmonic series, which converges by the Alternating Series Test.
  • Step 4: State the final interval of convergence.
    • The series converges for x=1x=1 but not for x=4x=4.
    • The interval of convergence is [1,4)[1, 4).

If you get this wrong, you should focus on: The full process for finding the interval of convergence: using the Ratio Test correctly with a center other than 0, solving the resulting inequality, and carefully testing the endpoints using appropriate series tests (like p-series or AST).

  1. Question: A sequence is defined by the recurrence relation an+1=12(an+9an)a_{n+1} = \frac{1}{2}(a_n + \frac{9}{a_n}) with a1=1a_1 = 1. Assuming the sequence converges, what is its limit? Then, calculate the first four terms of the sequence to observe its rate of convergence.
Answer
  • This is the Babylonian method for finding a square root.
  • Part 1: Find the limit.
    • Assume the sequence converges to a limit LL. Since all terms will be positive, LL must be positive.
    • As nn \to \infty, an+1La_{n+1} \to L and anLa_n \to L.
    • Substitute LL into the recurrence relation:
      • L=12(L+9L)L = \frac{1}{2}\left(L + \frac{9}{L}\right)
    • Solve for LL:
      • 2L=L+9L    L=9L    L2=92L = L + \frac{9}{L} \implies L = \frac{9}{L} \implies L^2 = 9
    • Since LL must be positive, the limit is L=3L=3.
  • Part 2: Calculate the first four terms.
    • a1=1a_1 = 1
    • a2=12(1+91)=12(10)=5a_2 = \frac{1}{2}\left(1 + \frac{9}{1}\right) = \frac{1}{2}(10) = 5
    • a3=12(5+95)=12(5+1.8)=12(6.8)=3.4a_3 = \frac{1}{2}\left(5 + \frac{9}{5}\right) = \frac{1}{2}\left(5 + 1.8\right) = \frac{1}{2}(6.8) = 3.4
    • a4=12(3.4+93.4)12(3.4+2.64705)=12(6.04705)3.0235a_4 = \frac{1}{2}\left(3.4 + \frac{9}{3.4}\right) \approx \frac{1}{2}(3.4 + 2.64705) = \frac{1}{2}(6.04705) \approx 3.0235
  • Observation: The sequence converges to the limit of 3 very quickly. The first term is off by 2, the second is off by 2, the third is off by 0.4, and the fourth is only off by about 0.02. This demonstrates quadratic convergence.

If you get this wrong, you should focus on: The technique for finding the limit of a convergent recursive sequence and performing iterative calculations.

  1. Question: Determine if the series n=1(11n)n2\sum_{n=1}^\infty \left(1 - \frac{1}{n}\right)^{n^2} converges or diverges. (Hint: A test other than the Ratio Test will be much more effective).
Answer
  • The presence of the n2n^2 power in the exponent strongly suggests using the Root Test.
  • Let an=(11n)n2a_n = \left(1 - \frac{1}{n}\right)^{n^2}.
  • Apply the Root Test:
    • L=limnann=limn(11n)n2nL = \lim_{n\to\infty} \sqrt[n]{|a_n|} = \lim_{n\to\infty} \sqrt[n]{\left(1 - \frac{1}{n}\right)^{n^2}}
    • L=limn((11n)n2)1/n=limn(11n)nL = \lim_{n\to\infty} \left( \left(1 - \frac{1}{n}\right)^{n^2} \right)^{1/n} = \lim_{n\to\infty} \left(1 - \frac{1}{n}\right)^n
  • This is a standard limit form related to the definition of ee. Recall the limit definition limn(1+xn)n=ex\lim_{n\to\infty} (1 + \frac{x}{n})^n = e^x.
  • In our case, x=1x=-1.
    • L=e1=1eL = e^{-1} = \frac{1}{e}
  • Since e2.718e \approx 2.718, we have L=1/e<1L = 1/e \lt 1.
  • Because the limit LL is less than 1, the series converges by the Root Test.

If you get this wrong, you should focus on: Recognizing when to apply the Root Test (especially for terms with powers of n) and knowing the limit definition of the exponential function exe^x.

  1. Question: Find the sum of the series n=12n2+4n+3\sum_{n=1}^{\infty} \frac{2}{n^2+4n+3}.
Answer
  • This is a telescoping series that requires factoring the denominator and using partial fractions.
  • Step 1: Factor the denominator and decompose the term.
    • n2+4n+3=(n+1)(n+3)n^2+4n+3 = (n+1)(n+3).
    • 2(n+1)(n+3)=An+1+Bn+3\frac{2}{(n+1)(n+3)} = \frac{A}{n+1} + \frac{B}{n+3}
    • 2=A(n+3)+B(n+1)2 = A(n+3) + B(n+1)
    • Let n=1n=-1: 2=A(2)    A=12 = A(2) \implies A=1.
    • Let n=3n=-3: 2=B(2)    B=12 = B(-2) \implies B=-1.
    • The term is 1n+11n+3\frac{1}{n+1} - \frac{1}{n+3}.
  • Step 2: Write out the partial sum SNS_N to find the cancellation pattern.
    • n=1:(1214)n=1: (\frac{1}{2} - \frac{1}{4})
    • n=2:(1315)n=2: (\frac{1}{3} - \frac{1}{5})
    • n=3:(1416)n=3: (\frac{1}{4} - \frac{1}{6})
    • n=4:(1517)n=4: (\frac{1}{5} - \frac{1}{7})
    • ...
    • n=N1:(1N1N+2)n=N-1: (\frac{1}{N} - \frac{1}{N+2})
    • n=N:(1N+11N+3)n=N: (\frac{1}{N+1} - \frac{1}{N+3})
  • The terms that do not cancel at the beginning are 12\frac{1}{2} and 13\frac{1}{3}.
  • The terms that do not cancel at the end are 1N+2-\frac{1}{N+2} (from the n=N1n=N-1 term) and 1N+3-\frac{1}{N+3} (from the n=Nn=N term).
  • SN=12+131N+21N+3S_N = \frac{1}{2} + \frac{1}{3} - \frac{1}{N+2} - \frac{1}{N+3}.
  • Step 3: Evaluate the limit.
    • S=limN(12+131N+21N+3)=12+1300=3+26=56S = \lim_{N\to\infty} \left( \frac{1}{2} + \frac{1}{3} - \frac{1}{N+2} - \frac{1}{N+3} \right) = \frac{1}{2} + \frac{1}{3} - 0 - 0 = \frac{3+2}{6} = \frac{5}{6}

If you get this wrong, you should focus on: Factoring quadratic denominators, partial fraction decomposition, and carefully identifying the surviving terms in a telescoping series where the terms are not consecutive.

  1. Question: A bank offers a special savings account. If you deposit USD 100 on the first day of the month, they add a USD 1 bonus at the end of the month. If you deposit USD 100 on the first day of the next month, they add a USD 2 bonus, and so on, with the bonus increasing by USD 1 each month. You deposit USD 100 each month for 2 years (24 months). What is the total amount of money in the account immediately after the 24th month's bonus is paid? (Assume no other interest is paid).
Answer
  • This problem can be broken into two parts: the sum of your deposits and the sum of the bank's bonuses.
  • Part 1: Sum of your deposits.
    • You deposit 100 each month for 24 months.
    • Total Deposits = 100×24=USD2,400100 \times 24 = \mathrm{USD } 2,400.
  • Part 2: Sum of the bank's bonuses.
    • The bonuses form an arithmetic sequence: 1, 2, 3, ..., 24.
    • We need to find the sum of this arithmetic series, S24S_{24}.
    • a1=1a_1 = 1, a24=24a_{24} = 24, n=24n=24.
    • S24=n2(a1+an)=242(1+24)=12(25)=USD300S_{24} = \frac{n}{2}(a_1 + a_n) = \frac{24}{2}(1 + 24) = 12(25) = \mathrm{USD } 300.
  • Part 3: Total amount.
    • Total Amount = Total Deposits + Total Bonuses
    • Total Amount = 2,400+300=USD2,7002,400 + 300 = \mathrm{USD } 2,700.

If you get this wrong, you should focus on: Breaking a word problem into its constituent parts and recognizing how to apply the formula for the sum of a simple arithmetic series.

  1. Question: Using the Maclaurin series for exe^x, find the exact value of the sum n=02nn!\sum_{n=0}^{\infty} \frac{2^n}{n!}. Then, use this result to find the sum of the related series n=22n(n1)!\sum_{n=2}^{\infty} \frac{2^n}{(n-1)!}.
Answer
  • Part 1: Find the sum of the first series.
    • The Maclaurin series for exe^x is n=0xnn!\sum_{n=0}^{\infty} \frac{x^n}{n!}.
    • The series n=02nn!\sum_{n=0}^{\infty} \frac{2^n}{n!} matches this form exactly with x=2x=2.
    • Therefore, the sum of the first series is e2e^2.
  • Part 2: Find the sum of the second series.
    • Let S=n=22n(n1)!S = \sum_{n=2}^{\infty} \frac{2^n}{(n-1)!}. This series is not in a standard form. We need to manipulate the index to make it match a known series.
    • Let k=n1k = n-1. When n=2n=2, k=1k=1. As nn \to \infty, kk \to \infty. Also, n=k+1n = k+1.
    • Substitute these into the sum:
      • S=k=12k+1k!=k=122kk!=2k=12kk!S = \sum_{k=1}^{\infty} \frac{2^{k+1}}{k!} = \sum_{k=1}^{\infty} \frac{2 \cdot 2^k}{k!} = 2 \sum_{k=1}^{\infty} \frac{2^k}{k!}
    • Now, the sum k=12kk!\sum_{k=1}^{\infty} \frac{2^k}{k!} is almost e2e^2.
    • We know e2=k=02kk!=200!+k=12kk!=1+k=12kk!e^2 = \sum_{k=0}^{\infty} \frac{2^k}{k!} = \frac{2^0}{0!} + \sum_{k=1}^{\infty} \frac{2^k}{k!} = 1 + \sum_{k=1}^{\infty} \frac{2^k}{k!}.
    • So, k=12kk!=e21\sum_{k=1}^{\infty} \frac{2^k}{k!} = e^2 - 1.
    • Substitute this back into our expression for S:
      • S=2(e21)S = 2(e^2 - 1)

If you get this wrong, you should focus on: Recognizing known Maclaurin series, and using index manipulation (re-indexing) to transform a given series into a more familiar form.

  1. Question: The sum k=1nk2=n(n+1)(2n+1)6\sum_{k=1}^n k^2 = \frac{n(n+1)(2n+1)}{6} is a well-known formula. Use this to find the value of the series k=520(3k25)\sum_{k=5}^{20} (3k^2 - 5).
Answer
  • We need to manipulate the sum to use the given formula, which starts at k=1k=1.
  • Step 1: Split the sum and use properties of summation.
    • k=520(3k25)=k=5203k2k=5205=3k=520k25k=5201\sum_{k=5}^{20} (3k^2 - 5) = \sum_{k=5}^{20} 3k^2 - \sum_{k=5}^{20} 5 = 3\sum_{k=5}^{20} k^2 - 5 \sum_{k=5}^{20} 1
  • Step 2: Adjust the indices of the sums.
    • For the first sum: k=520k2=(k=120k2)(k=14k2)\sum_{k=5}^{20} k^2 = \left(\sum_{k=1}^{20} k^2\right) - \left(\sum_{k=1}^{4} k^2\right).
    • For the second sum: There are 205+1=1620 - 5 + 1 = 16 terms. So k=5205=5×16=80\sum_{k=5}^{20} 5 = 5 \times 16 = 80.
  • Step 3: Apply the formula for the sum of squares.
    • k=120k2=20(20+1)(2(20)+1)6=20(21)(41)6=10(7)(41)=2870\sum_{k=1}^{20} k^2 = \frac{20(20+1)(2(20)+1)}{6} = \frac{20(21)(41)}{6} = 10(7)(41) = 2870.
    • k=14k2=4(4+1)(2(4)+1)6=4(5)(9)6=2(5)(3)=30\sum_{k=1}^{4} k^2 = \frac{4(4+1)(2(4)+1)}{6} = \frac{4(5)(9)}{6} = 2(5)(3) = 30.
  • Step 4: Substitute back and calculate the final result.
    • k=520k2=287030=2840\sum_{k=5}^{20} k^2 = 2870 - 30 = 2840.
    • Original expression = 3(2840)80=852080=84403(2840) - 80 = 8520 - 80 = 8440.

If you get this wrong, you should focus on: Properties of sigma notation, specifically how to change the starting and ending indices of a sum to match a known formula.

  1. Question: Does the series n=1nnn!\sum_{n=1}^\infty \frac{n^n}{n!} converge or diverge? Justify your answer with an appropriate test.
Answer
  • This series can be tested with the Ratio Test, but a simpler approach is the Test for Divergence.
  • Method 1: Test for Divergence
    • Let's examine the limit of the terms an=nnn!a_n = \frac{n^n}{n!}.
    • Write out the term: an=nnnn123n=(n1)(n2)(nn)a_n = \frac{n \cdot n \cdot n \cdots n}{1 \cdot 2 \cdot 3 \cdots n} = \left(\frac{n}{1}\right) \left(\frac{n}{2}\right) \cdots \left(\frac{n}{n}\right).
    • Each factor (nk)(\frac{n}{k}) is 1\ge 1. The first factor is nn.
    • So, an=n1(productofterms1)na_n = \frac{n}{1} \cdot (\mathrm{product of terms } \ge 1) \ge n.
    • As nn \to \infty, ana_n \to \infty because anna_n \ge n.
    • Since limnan0\lim_{n\to\infty} a_n \ne 0, the series diverges by the Test for Divergence.
  • Method 2: Ratio Test
    • L=limn(n+1)n+1(n+1)!n!nn=limn(n+1)n+1(n+1)n!n!nnL = \lim_{n\to\infty} \left| \frac{(n+1)^{n+1}}{(n+1)!} \cdot \frac{n!}{n^n} \right| = \lim_{n\to\infty} \frac{(n+1)^{n+1}}{(n+1)n!} \cdot \frac{n!}{n^n}
    • L=limn(n+1)nnn=limn(n+1n)n=limn(1+1n)n=eL = \lim_{n\to\infty} \frac{(n+1)^n}{n^n} = \lim_{n\to\infty} \left(\frac{n+1}{n}\right)^n = \lim_{n\to\infty} \left(1 + \frac{1}{n}\right)^n = e
  • Since L=e2.718>1L = e \approx 2.718 \gt 1, the series diverges by the Ratio Test.

If you get this wrong, you should focus on: The Test for Divergence as a first-line check, and the application of the Ratio Test leading to the limit definition of ee.

  1. Question: A sequence is defined recursively by x1=2x_1 = \sqrt{2} and xn+1=2+xnx_{n+1} = \sqrt{2 + x_n} for n1n \ge 1. Prove that this sequence converges and find its limit.
Answer
  • To prove convergence without knowing the limit, we can use the Monotone Convergence Theorem, which requires showing the sequence is both monotonic and bounded.
  • Step 1: Show the sequence is bounded above by 2.
    • We use mathematical induction.
    • Base Case: x1=2<2x_1 = \sqrt{2} \lt 2. True.
    • Inductive Hypothesis: Assume xk<2x_k \lt 2 for some integer k1k \ge 1.
    • Inductive Step: We must show xk+1<2x_{k+1} \lt 2.
      • xk+1=2+xk<2+2=4=2x_{k+1} = \sqrt{2 + x_k} \lt \sqrt{2 + 2} = \sqrt{4} = 2 The inequality holds because xk<2x_k \lt 2. Thus, the sequence is bounded above by 2.
  • Step 2: Show the sequence is monotonic increasing (xn+1xnx_{n+1} \ge x_n).
    • We use induction again.
    • Base Case: x2=2+2>2=x1x_2 = \sqrt{2+\sqrt{2}} \gt \sqrt{2} = x_1. True.
    • Inductive Hypothesis: Assume xkxk1x_k \ge x_{k-1} for some integer k2k \ge 2.
    • Inductive Step: We must show xk+1xkx_{k+1} \ge x_k.
      • xkxk1    2+xk2+xk1    2+xk2+xk1    xk+1xkx_k \ge x_{k-1} \implies 2+x_k \ge 2+x_{k-1} \implies \sqrt{2+x_k} \ge \sqrt{2+x_{k-1}} \implies x_{k+1} \ge x_k Thus, the sequence is monotonic increasing.
  • Step 3: Conclude convergence and find the limit.
    • Since the sequence is bounded above and monotonic increasing, it must converge by the Monotone Convergence Theorem. Let the limit be LL.
    • To find LL, we take the limit of the recurrence relation:
      • limnxn+1=limn2+xn\lim_{n\to\infty} x_{n+1} = \lim_{n\to\infty} \sqrt{2 + x_n}
      • L=2+LL = \sqrt{2 + L}
    • Square both sides: L2=2+L    L2L2=0L^2 = 2 + L \implies L^2 - L - 2 = 0.
    • Factor the quadratic: (L2)(L+1)=0(L-2)(L+1) = 0.
    • The possible limits are L=2L=2 or L=1L=-1. Since all terms of the sequence are positive, the limit must be positive.
    • Therefore, the limit of the sequence is 2.

If you get this wrong, you should focus on: The Monotone Convergence Theorem, proof by mathematical induction for boundedness and monotonicity, and finding the limit of a recursively defined sequence.

For the A-Level treatment of this topic, see Sequences and Series.


tip

tip Ready to test your understanding of Sequences and Series? The diagnostic test contains the hardest questions within the DSE specification for this topic, each with a full worked solution.

Unit tests probe edge cases and common misconceptions. Integration tests combine Sequences and Series with other DSE mathematics topics to test synthesis under exam conditions.

See Diagnostic Guide for instructions on self-marking and building a personal test matrix.