9. Linear Recurrences

If a sequence is defined by xn=Axn−1+Bxn−2x_n = A x_{n-1} + B x_{n-2}, assume a geometric solution xn=rnx_n = r^n. Substituting yields the Characteristic Equation:

r2−Ar−B=0r^2 - Ar - B = 0

If this quadratic has distinct roots r1,r2r_1, r_2, the formula is xn=C1(r1)n+C2(r2)nx_n = C_1(r_1)^n + C_2(r_2)^n.

  • Repeated Roots: If (r−1)2=0(r-1)^2 = 0, the roots repeat, and the solution takes the form an=C1+C2na_n = C_1 + C_2n.
  • Complex Roots: Equations like r2−2r+2=0r^2 - 2r + 2 = 0 yield 1±i1 \pm i. This indicates the sequence will oscillate.

10. AMC Tricks

When you see these expressions on a contest, bypass standard algebra and use these direct rewrites:

ExpressionRewriteTechnique
kk+1\frac{k}{k+1}1−1k+11 - \frac{1}{k+1}Telescoping
k+1k\frac{k+1}{k}1+1k1 + \frac{1}{k}Telescoping
1k+1+k\frac{1}{\sqrt{k+1} + \sqrt{k}}k+1−k\sqrt{k+1} - \sqrt{k}Rationalize Conjugate
1k(k+1)\frac{1}{k(k+1)}1k−1k+1\frac{1}{k} - \frac{1}{k+1}Partial Fractions
1k2−1\frac{1}{k^2-1}12(1k−1−1k+1)\frac{1}{2}(\frac{1}{k-1} - \frac{1}{k+1})Non-Adjacent Partial Fractions
an+1=pan+qa_{n+1} = pa_n + qbn+1=pbnb_{n+1} = p b_nShift by fixed point
an+1=f(an)a_{n+1} = f(a_n)L=f(L)L = f(L)Find fixed point limit

Worked Examples

Example 1: Finite Differences

Problem: Find the nnth term formula for the sequence 2,7,16,29,46,…2, 7, 16, 29, 46, \dots

Solution: Take the first differences between consecutive terms: 5,9,13,17…5, 9, 13, 17 \dots Take the second differences: 4,4,4…4, 4, 4 \dots Because the second difference is a constant 44, the sequence is governed by a quadratic formula an=An2+Bn+Ca_n = An^2 + Bn + C. Using the first three terms (n=1,2,3n=1, 2, 3):

  1. A+B+C=2A + B + C = 2
  2. 4A+2B+C=74A + 2B + C = 7
  3. 9A+3B+C=169A + 3B + C = 16

Subtracting (1) from (2) gives 3A+B=53A + B = 5. Subtracting (2) from (3) gives 5A+B=95A + B = 9. Subtracting those results yields 2A=4  ⟹  A=22A = 4 \implies A = 2. Substituting back: 3(2)+B=5  ⟹  B=−13(2) + B = 5 \implies B = -1. Finally: 2−1+C=2  ⟹  C=12 - 1 + C = 2 \implies C = 1. Formula: an=2n2−n+1a_n = 2n^2 - n + 1.

Example 2: Polynomial Summation

Problem: Evaluate the sum ∑k=140k(k+2)\sum_{k=1}^{40} k(k+2).

Solution: Expand the expression inside the sum: ∑k=140(k2+2k)\sum_{k=1}^{40} (k^2 + 2k). Use the linearity of summation: ∑k=140k2+2∑k=140k\sum_{k=1}^{40} k^2 + 2\sum_{k=1}^{40} k. Apply the known power sum formulas with n=40n=40:

40(41)(81)6+2(40(41)2)\frac{40(41)(81)}{6} + 2 \left(\frac{40(41)}{2}\right)
22140+1640=2378022140 + 1640 = 23780

Example 3: Hidden Multiple Geometric Series

Problem: Evaluate ∑k=1∞2k+3k5k\sum_{k=1}^{\infty} \frac{2^k + 3^k}{5^k}.

Solution: Split the fraction into two separate infinite geometric series:

∑k=1∞(25)k+∑k=1∞(35)k\sum_{k=1}^{\infty} \left(\frac{2}{5}\right)^k + \sum_{k=1}^{\infty} \left(\frac{3}{5}\right)^k

For the first series: a=25,r=25  ⟹  S1=2/51−2/5=23a = \frac{2}{5}, r = \frac{2}{5} \implies S_1 = \frac{2/5}{1 - 2/5} = \frac{2}{3}. For the second series: a=35,r=35  ⟹  S2=3/51−3/5=32a = \frac{3}{5}, r = \frac{3}{5} \implies S_2 = \frac{3/5}{1 - 3/5} = \frac{3}{2}. Total sum: 23+32=136\frac{2}{3} + \frac{3}{2} = \frac{13}{6}.

Example 4: Non-Adjacent Partial Fractions

Problem: Evaluate ∑k=1991k2+2k\sum_{k=1}^{99} \frac{1}{k^2 + 2k}.

Solution: Set up partial fractions: 1k(k+2)=12(1k−1k+2)\frac{1}{k(k+2)} = \frac{1}{2} \left(\frac{1}{k} - \frac{1}{k+2}\right). Because the gap between denominators is 22, two positive terms survive at the start and two negative terms survive at the end.

12(11+12−1100−1101)\frac{1}{2} \left( \frac{1}{1} + \frac{1}{2} - \frac{1}{100} - \frac{1}{101} \right)
12(32−20110100)=1494920200\frac{1}{2} \left( \frac{3}{2} - \frac{201}{10100} \right) = \frac{14949}{20200}

Example 5: The Recursive Fixed Point Limit

Problem: A sequence is defined by a1=3a_1 = 3 and an+1=5an−4an+1a_{n+1} = \frac{5a_n - 4}{a_n + 1}. Assuming the sequence converges, find its limit.

Solution: At infinity, both ana_n and an+1a_{n+1} become indistinguishable from the limit LL.

L=5L−4L+1L = \frac{5L - 4}{L + 1}
L2+L=5L−4L^2 + L = 5L - 4
L2−4L+4=0L^2 - 4L + 4 = 0
(L−2)2=0  ⟹  L=2(L - 2)^2 = 0 \implies L = 2

Example 6: The Arithmetico-Geometric Series (AGS)

Problem: Evaluate the infinite sum S=∑n=1∞n2nS = \sum_{n=1}^\infty \frac{n}{2^n}.

Solution: Write out the first few terms to see the structure:

S=12+24+38+416+…S = \frac{1}{2} + \frac{2}{4} + \frac{3}{8} + \frac{4}{16} + \dots

Multiply the entire sum by the common geometric ratio r=1/2r = 1/2:

12S=14+28+316+…\frac{1}{2}S = \frac{1}{4} + \frac{2}{8} + \frac{3}{16} + \dots

Subtract the shifted sum from the original sum. Notice how aligning the denominators causes the arithmetic numerator to drop to a constant 11:

S−12S=12+(24−14)+(38−28)+…S - \frac{1}{2}S = \frac{1}{2} + \left(\frac{2}{4} - \frac{1}{4}\right) + \left(\frac{3}{8} - \frac{2}{8}\right) + \dots
12S=12+14+18+…\frac{1}{2}S = \frac{1}{2} + \frac{1}{4} + \frac{1}{8} + \dots

The right side is now a pure geometric series summing to 11.

12S=1  ⟹  S=2\frac{1}{2}S = 1 \implies S = 2

Example 7: Radical Telescoping

Problem: Evaluate ∑n=1991n+n+1\sum_{n=1}^{99} \frac{1}{\sqrt{n} + \sqrt{n+1}}.

Solution: Rationalize the denominator by multiplying by the conjugate n+1−n\sqrt{n+1} - \sqrt{n}:

1n+n+1⋅n+1−nn+1−n=n+1−n\frac{1}{\sqrt{n} + \sqrt{n+1}} \cdot \frac{\sqrt{n+1} - \sqrt{n}}{\sqrt{n+1} - \sqrt{n}} = \sqrt{n+1} - \sqrt{n}

Now write out the telescoped sum:

(2−1)+(3−2)+⋯+(100−99)(\sqrt{2} - \sqrt{1}) + (\sqrt{3} - \sqrt{2}) + \dots + (\sqrt{100} - \sqrt{99})

The middle collapses entirely, leaving only 100−1=10−1=9\sqrt{100} - \sqrt{1} = 10 - 1 = 9.

Example 8: Solving a Linear Recurrence

Problem: A sequence is defined by a0=0,a1=1a_0 = 0, a_1 = 1, and an=5an−1−6an−2a_n = 5a_{n-1} - 6a_{n-2}. Find an explicit formula for ana_n.

Solution: Set up the characteristic equation:

r2−5r+6=0r^2 - 5r + 6 = 0

Factoring yields (r−2)(r−3)=0(r-2)(r-3) = 0, so the roots are r1=2r_1 = 2 and r2=3r_2 = 3. General solution: an=C1(2)n+C2(3)na_n = C_1(2)^n + C_2(3)^n. Using initial conditions: n=0  ⟹  0=C1+C2  ⟹  C1=−C2n=0 \implies 0 = C_1 + C_2 \implies C_1 = -C_2 n=1  ⟹  1=2C1+3C2  ⟹  1=−2C2+3C2  ⟹  C2=1,C1=−1n=1 \implies 1 = 2C_1 + 3C_2 \implies 1 = -2C_2 + 3C_2 \implies C_2 = 1, C_1 = -1. Explicit formula: an=3n−2na_n = 3^n - 2^n.

Example 10: Where the Telescoping Method is NOT Obvious

Problem: Evaluate ∑k=11002k+1k2(k+1)2\sum_{k=1}^{100} \frac{2k+1}{k^2(k+1)^2}.

Solution: Unlike standard partial fractions, this numerator looks troublesome. However, look for the derivative or a difference of squares in the numerator. Notice that (k+1)2−k2=(k2+2k+1)−k2=2k+1(k+1)^2 - k^2 = (k^2+2k+1) - k^2 = 2k+1. Rewrite the fraction:

(k+1)2−k2k2(k+1)2=(k+1)2k2(k+1)2−k2k2(k+1)2=1k2−1(k+1)2\frac{(k+1)^2 - k^2}{k^2(k+1)^2} = \frac{(k+1)^2}{k^2(k+1)^2} - \frac{k^2}{k^2(k+1)^2} = \frac{1}{k^2} - \frac{1}{(k+1)^2}

The fraction telescopes perfectly!

(112−122)+(122−132)+⋯+(11002−11012)\left(\frac{1}{1^2} - \frac{1}{2^2}\right) + \left(\frac{1}{2^2} - \frac{1}{3^2}\right) + \dots + \left(\frac{1}{100^2} - \frac{1}{101^2}\right)

The sum completely collapses to 1−110121 - \frac{1}{101^2}.

Example 11: Summation by Pairing

Problem: Evaluate ∑k=1100k(101−k)\sum_{k=1}^{100} k(101-k).

Solution: While you could expand this into 101∑k−∑k2101\sum k - \sum k^2 and use power formulas, you can also recognize pairing symmetry. Let the sum be S=1(100)+2(99)+3(98)+⋯+99(2)+100(1)S = 1(100) + 2(99) + 3(98) + \dots + 99(2) + 100(1). Notice that term 1 equals term 100, term 2 equals term 99, etc. This symmetric behavior implies you only need to evaluate the first 50 terms and double it:

S=2∑k=150k(101−k)S = 2 \sum_{k=1}^{50} k(101-k)

This reduces the computational load and minimizes arithmetic errors during contests.

Example 12: Sequence as a Polynomial Difference

Problem: If an=n3a_n = n^3, find the degree of the sequence bn=an+1−anb_n = a_{n+1} - a_n.

Solution: Evaluate the difference explicitly:

bn=(n+1)3−n3=(n3+3n2+3n+1)−n3=3n2+3n+1b_n = (n+1)^3 - n^3 = (n^3 + 3n^2 + 3n + 1) - n^3 = 3n^2 + 3n + 1

The sequence bnb_n is a quadratic polynomial. Taking the difference of any polynomial sequence lowers its degree by exactly 1.

Example 13: The Synthesis

Problem: Evaluate ∑k=1100k(k+1)!\sum_{k=1}^{100} \frac{k}{(k+1)!}.

Solution: Generate a telescoping form by rewriting the numerator:

k(k+1)!=(k+1)−1(k+1)!=k+1(k+1)!−1(k+1)!\frac{k}{(k+1)!} = \frac{(k+1) - 1}{(k+1)!} = \frac{k+1}{(k+1)!} - \frac{1}{(k+1)!}

Simplify the left fraction by cancelling (k+1)(k+1):

1k!−1(k+1)!\frac{1}{k!} - \frac{1}{(k+1)!}

We have successfully engineered a perfect telescoping series! Now write out the sum:

(11!−12!)+(12!−13!)+⋯+(1100!−1101!)\left(\frac{1}{1!} - \frac{1}{2!}\right) + \left(\frac{1}{2!} - \frac{1}{3!}\right) + \dots + \left(\frac{1}{100!} - \frac{1}{101!}\right)

Every intermediate term cancels, leaving 1−1101!1 - \frac{1}{101!}.

Practice Problems

StatusSourceProblem NameDifficultyTags
AMC 10Hard
Show TagsRecursion, Sequences
AIMEHard
Show TagsSeries
OwnHard
Show TagsArithmetic-Geometric Mean, Recursion
OwnNormal
Show TagsSummation, Telescoping Series
OwnHard
Show TagsFloor Function, Number Theory, Sequences
Berkeley Math CircleHard
Show TagsSequences and Series
MathNetHard
Show TagsSequences and Series, Simple Equations
USA IMO 2003Hard
Show TagsInduction / smoothing, Invariants / monovariants, Sequences and Series
Harvard-MIT Mathematics TournamentHard
Show TagsSequences and Series
Harvard-MIT Mathematics TournamentHard
Show TagsQuadratic functions, Sequences and Series
Team Selection TestHard
Show TagsInvariants / monovariants, Sequences and Series
IMO 2009Hard
Show TagsSequences and Series
Harvard-MIT Mathematics TournamentHard
Show TagsAlgebraic properties of binomial coefficients, Generating functions, Sequences and Series
Harvard-MIT Mathematics TournamentHard
Show TagsComplex numbers, Sequences and Series
HMMT 2013Hard
Show TagsLinear and quadratic inequalities, Sequences and Series
HMMTHard
Show TagsSequences and Series
AMC 10 AHard
Show TagsFactorization techniques, Sequences and Series
AMC 10 AHard
Show TagsSequences and Series, Simple Equations
HMMT February 2025Hard
Show TagsGreatest common divisors (gcd), Sequences and Series
Berkeley Math CircleHard
Show TagsSums and products, Telescoping series
Berkeley Math Circle Take-Home Contest #6Hard
Show TagsInduction / smoothing, Polynomial operations, Sums and products, Telescoping series
Berkeley Math Circle Monthly Contest 4Hard
Show TagsSums and products, Telescoping series
MathNetHard
Show TagsSums and products, Telescoping series
Berkeley Math Circle Monthly Contest 5Hard
Show TagsRecurrence relations, Telescoping series
MathNetHard
Show TagsSums and products, Telescoping series

Module Progress:

Join the Discord Community!

Stuck on a problem, or don't understand a module? Join the Discord and get help with your doubts while making more math friends.