Q: What does H2 Maths Notes (JC 1-2): 2.1) Sequences and Series cover? A: Convergence tests, AP/GP formulae, sigma notation, and standard H2 sequences problem types.
Before you revise Keep a separate page for identities: arithmetic/geometric sums, binomial expansions, and standard limits. Most errors come from mixing up first term and common ratio definitions.
A sequence lists terms; a series adds them: Decide whether the question asks for un or Sn.
AP uses difference; GP uses ratio: Identify a
Reviewed by
Marcus Pang·Managing Director (Maths)
,
d
, or
r
before substituting.
Convergence needs a condition, not just a formula: Check ∣r∣<1 before using S∞.
Concrete example: For 5,2.5,1.25,…, the ratio is 0.5. Since ∣r∣<1, the infinite sum is 1−0.55=10.
Status: SEAB's current H2 Mathematics (9758) syllabus PDF is labelled for 2026. Topic 2.1 scope is within Section A Pure Mathematics, which is assessed in Paper 1 (100 marks) and Paper 2 Section A (40 marks).
Core Definitions
A sequence is an ordered list of terms un. The nth partial sum is Sn=u1+u2+⋯+un.
Arithmetic progression (AP): constant difference d with un=a+(n−1)d and Sn=2n(2a+(n−1)d)
Geometric progression (GP): constant ratio r with un=arn−1 and Sn=a1−r1−rn
Infinite GP converges if ∣r∣<1 with sum S∞=1−ra
Convergence and Limits
Use limits to test behaviour: n→∞limun exists if terms settle to a finite value.
For recursive sequences un+1=f(un), solve the fixed point L=f(L) and show un is monotonic and bounded.
Divergence occurs when terms grow without bound or oscillate without settling.
Example -- Recurrence limit
Given u1=2 and un+1=21(un+un5), show convergence.
Suppose un→L; then L=21(L+L5) leading to L2=5 so L=5 (take positive root since terms stay positive).
Show un is increasing and bounded above by 5.
Recurrence proof checkpoint
For a recurrence question, separate the candidate limit from the proof that the sequence actually reaches it. Solving L=f(L) only gives a possible limit.
Step
What to write
Why it matters
Candidate limit
Let un→L, substitute into L=f(L), and choose the root consistent with the term sign.
This identifies the value the sequence could approach.
Monotonicity
Find the sign of un+1−un, or compare un+1
This shows the terms move in one direction instead of jumping around.
Bound
Prove an upper bound for an increasing sequence, or a lower bound for a decreasing sequence.
This prevents the sequence from increasing or decreasing without limit.
Conclusion
State that monotonic and bounded behaviour implies convergence, then quote the fixed point.
This connects the proof to the candidate limit.
Common trap: do not stop after solving L=f(L). A fixed point is not a convergence proof unless monotonicity and boundedness have also been established.
Sigma Notation and Manipulation
Express sums as k=1∑nuk. Familiar identities:
k=1∑nk=2n(n+1),k=1∑nk2=6n(n+1)(2n+1),k=1∑nrk=r1−r1−rn.
Split linear combinations: ∑(ak+bk)=∑ak+∑bk
To shift indices, substitute k=j+c and adjust limits.
Sigma index-shift checkpoint
When changing the index, track the old index, the new index, the new limits, and the rewritten term together. Do not change only the lower limit and leave the term untouched.
Original sum
New index choice
New limits
Rewritten term
k=1∑nuk+1
Let j=k+1.
j=2 to n+1.
j=2∑n+1uj
k=3∑n(k−2)2
Let j=k−2
k=0∑n−1ark
Keep k if the GP already starts at zero.
k=0
Common trap: changing the index name does not change the sum, but changing a start or end value without changing the term usually changes the sum. Recalculate both limits from the same substitution before using a standard identity.
Telescoping decomposition checkpoint
For rational terms, aim to rewrite each term as "next difference" so the middle terms cancel when expanded.
Term shape
Try this rewrite
Cancellation check
Common trap
k(k+1)1
k1−k+11
Adjacent terms cancel from −1/(k+1) and +1/(k+1).
Leaving the final answer as a long unsimplified sum.
(k+a)(k+b)1
Use partial fractions with denominators k+a and k+b
ln(ukuk+1)
Worked check: k(k+2)1=21(k1−k+21). The factor 21 stays outside the cancellation, and two starting terms plus two ending terms survive.
Misconception check: telescoping is not just "cancel everything in the middle". First prove the decomposition, then expand enough terms to see exactly which first and last terms remain.
Example -- Telescoping sum
Evaluate the following series:
k=1∑nk(k+1)1
Decompose: Result:k(k+1)1=k1−k+11
Terms telescope to Result:1−n+11=n+1n
Arithmetic and Geometric Applications
Mixture problems: combine AP and GP components for salaries, payments, or depreciation.
Sum to infinity: verify ∣r∣<1 before using S∞.
Insert means: For inserting k arithmetic means between a and b, use AP formula; for geometric means, use GP ratio r=(ab)1/(k+1).
AP or GP modelling checkpoint
Before choosing a formula, translate the wording into "add the same amount" or "multiply by the same factor".
Wording clue
Model to use
First labels to write
Common trap
"increases by 150 each year"
AP
First term a, common difference d=150, number of terms n.
Treating a fixed dollar increase as a percentage increase.
"decreases by 8% each year"
GP
First term a, common ratio r=0.92, number of terms n.
Using r=8
"total paid over 24 months"
Finite series
Decide whether the first payment is term 1 and count all included payments.
Using the final month number as n without checking the starting month.
"continues indefinitely"
Infinite GP only if ∣r∣<1
State the convergence check before S∞.
Quoting a/(1−r)
Worked check: a scholarship top-up starts at 500 and increases by 40 each semester for 6 semesters. This is an AP because the same amount is added each time, so a=500, d=40, and n=6. The total is
S6=26(2(500)+5(40))=3600.
Misconception check: percentage change is multiplicative, but fixed dollar change is additive. The units in the wording usually tell you whether the model is AP or GP.
Example -- Investment
A fund receives 200 monthly with constant growth of 1.2%. After 36 deposits, the total amount is an increasing annuity:
S36=200×0.012(1.012)36−1≈8.94×103.
Binomial Links
Use binomial coefficients:
(kn)=k!(n−k)!n!
Expand (1+x)n and match coefficients to sequences.
Recognise common combinatorial sums like
∑(kn)=2n
Want weekly guided practice on Sequences and Series? Our H2 Maths tuition programme builds fluency in this topic through structured problem sets and exam-style drills.
Common exam mistakes
Applying S∞ without checking ∣r∣<1: The infinite geometric sum formula only converges when ∣r∣<1. Students frequently skip the convergence check and apply S∞=a/(1−r) even when r≥1. Always state and verify the convergence condition before using the formula.
Confusing monotonicity with convergence in recurrence proofs: Showing that a sequence is increasing is not sufficient to prove convergence - it must also be bounded above. Similarly, a decreasing sequence must be bounded below. Both conditions are required; omitting either makes the proof incomplete.
Off-by-one errors with the number of terms: The AP/GP formulas for Sn assume n terms starting from u1. If the series starts from a different index or the question asks for the sum from term m to term
Forgetting to show a common point when testing collinearity: For sigma notation, a common error is forgetting that ∑k=1nc=cn (constant sum). Students sometimes leave c unsummed when splitting a combined sigma expression.
Using the AP sum formula for a GP (or vice versa): Under exam pressure, students mix up which formula applies. The key check: does the sequence have a constant difference (AP) or a constant ratio (GP)?
Frequently asked questions
Are sequences and series in Paper 1 or Paper 2? Topic 2 is Pure Mathematics and can appear in Paper 1 (100 marks) or Paper 2 Section A (40 marks). Financial modelling and recurrence questions are common long-structured questions.
Do I need to memorise the sum formulas for AP and GP? Yes. The AP and GP sum formulas are not provided in the SEAB MF27 formula booklet, so they must be memorised. The standard sigma identities (∑k=n(n+1)/2, ∑k2) also need to be known.
How do I prove a recursive sequence converges? The standard approach for H2 Maths is: (1) assume the limit L exists and solve L=f(L) for the fixed point; (2) prove the sequence is monotonic (via the sign of un+1−un); (3) prove it is bounded (above if increasing, below if decreasing). All three steps together establish convergence.
