Recurrence Relations
A recurrence defines each term from the ones before it. The most famous is Fibonacci, F(n) = F(n−1) + F(n−2), starting 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ... CAT rarely needs a closed form here; it needs you to compute a few terms carefully or to spot a useful identity. Two identities pay off: the sum of the first n Fibonacci numbers is F(n+2) − 1, and the running pattern of a recurrence often repeats or cycles — so when a problem asks for a far-out term, check whether the sequence is periodic (especially when terms are taken modulo something, or defined by alternating signs). For an AGP (arithmetic-geometric progression), where the nth term is an AP term times a GP term such as n·2^(n−1), the standard technique is the S − rS shift: write the sum S, multiply it by the common ratio r, subtract, and the staggered terms collapse into a plain GP plus boundary terms. For an infinite AGP with |r| < 1 the sum is a/(1−r) + dr/(1−r)². The exam-smart habit: for any recurrence, unroll three or four terms before reaching for theory — the pattern is often obvious.
✅ Solved examples
✏️ Practice — try these, take hints as needed
📝 Topic test — 8 questions
Auto-graded with full solutions; saved to your dashboard. Use the calculator and formula sheet (top-right) any time.
Formula Reference Sheet
Special sums (first n terms)
| Sum of first n naturals | 1+2+...+n = n(n+1)/2 |
|---|---|
| Sum of first n squares | 1²+2²+...+n² = n(n+1)(2n+1)/6 |
| Sum of first n cubes | 1³+2³+...+n³ = [n(n+1)/2]² |
| Sum of first n odd numbers | 1+3+5+...+(2n−1) = n² |
| Sum of first n even numbers | 2+4+...+2n = n(n+1) |
| Key link: cubes = (sum)² | Σk³ = (Σk)² = [n(n+1)/2]² |
Telescoping, AGP & recurrences
| Telescoping split | 1/[k(k+1)] = 1/k − 1/(k+1) |
|---|---|
| General telescoping | 1/[k(k+d)] = (1/d)[1/k − 1/(k+d)] |
| AGP sum to infinity (|r|<1) | S∞ = a/(1−r) + dr/(1−r)² |
| AGP finite sum method | Compute S − rS to collapse to a GP |
| Linear recurrence (Fibonacci) | F(n) = F(n−1) + F(n−2) |
| Sum of first n Fibonacci | F1+F2+...+Fn = F(n+2) − 1 |