MM2: Sequences, Series, Sigma Notation and Binomial Expansion
Official Cambridge & Imperial ESAT specification requirements for Sequences, Series, Sigma Notation and Binomial Expansion on the Mathematics 2 paper. Understand the syllabus boundaries, spot distractor traps engineered by examiners, and master the 2-step Sub-90 shortcuts that compress solve time well below the 88.8-second cutoff.
Official Syllabus Subtopics
Requirements specified in the UAT-UK framework
- 1Arithmetic progressions: uₙ = a + (n−1)d, Sₙ = (n/2)(2a + (n−1)d)
- 2Geometric progressions: uₙ = arⁿ⁻¹, Sₙ = a(1 − rⁿ)/(1 − r)
- 3Sum to infinity for convergent geometric series: S∞ = a / (1 − r) for |r| < 1
- 4Sigma notation with fence-post indexing: number of terms = n - m + 1
- 5Periodic and oscillating recurrence relations: uₙ₊₁ = f(uₙ)
- 6Binomial expansion (a + bx)ⁿ with combination coefficients nCr
Sub-90 Exam Speed Tips
How top candidates solve this spec under the 88.8s clock
The number of terms in Σ f(r) from r = m to n is n - m + 1, not n - m.
For recurrence relations, write out the first 4 terms to identify the period length p, then evaluate N mod p.
Examiners engineer distractor options using common algebraic expansions and sign slips. Always test structural ratios or invariants before calculating arithmetic values.
Tested Topics in Specification MM2
Master the individual question patterns and Sub-90 shortcuts for this specification.
Coupled Arithmetic & Geometric Progressions and Sum to Infinity (S∞)
Use the mean identities directly: three terms x, y, z are in AP iff 2y = x + z, and in GP iff y² = xz. Always verify |r| < 1 if S(infinity) is mentioned.
Sigma Notation (Fence-Post n-m+1 Terms) & Periodic Recurrence Relations (uₙ₊₁ = f(uₙ))
For recurrence relations uₙ₊₁ = f(uₙ) asking for u₁₀₀ or sumₙ₌₁¹⁰⁰, compute u₁, u₂, u₃, u₄ first—90% of ESAT/TMUA recurrences are periodic with period 2, 3, 4, or 6. In sumᵣ₌ₘⁿ, count = n - m + 1.
Binomial Expansion (a + bx)ⁿ Term Isolation, Constant Terms & Multi-Bracket Coefficients
Never expand the full bracket: write the general term Tᵣ = nCr * aⁿ⁻ʳ * bʳ * xᵖ⁽ⁿ⁻ʳ⁾⁺qʳ, set the exponent p(n-r) + qr equal to the target power (0 for constant term), solve for r in 5 seconds, and evaluate only that single term.
Ready to Master Specification MM2 Under Exam Conditions?
Practice timed questions under the authentic Pearson VUE interface with live split stopwatch pacing, dry-wipe scratchpad, and distractor forensics.