9. Linear Recurrences
If a sequence is defined by , assume a geometric solution . Substituting yields the Characteristic Equation:
If this quadratic has distinct roots , the formula is .
- Repeated Roots: If , the roots repeat, and the solution takes the form .
- Complex Roots: Equations like yield . 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:
| Expression | Rewrite | Technique |
|---|---|---|
| Telescoping | ||
| Telescoping | ||
| Rationalize Conjugate | ||
| Partial Fractions | ||
| Non-Adjacent Partial Fractions | ||
| Shift by fixed point | ||
| Find fixed point limit |
Worked Examples
Example 1: Finite Differences
Problem: Find the th term formula for the sequence
Solution: Take the first differences between consecutive terms: Take the second differences: Because the second difference is a constant , the sequence is governed by a quadratic formula . Using the first three terms ():
Subtracting (1) from (2) gives . Subtracting (2) from (3) gives . Subtracting those results yields . Substituting back: . Finally: . Formula: .
Example 2: Polynomial Summation
Problem: Evaluate the sum .
Solution: Expand the expression inside the sum: . Use the linearity of summation: . Apply the known power sum formulas with :
Example 3: Hidden Multiple Geometric Series
Problem: Evaluate .
Solution: Split the fraction into two separate infinite geometric series:
For the first series: . For the second series: . Total sum: .
Example 4: Non-Adjacent Partial Fractions
Problem: Evaluate .
Solution: Set up partial fractions: . Because the gap between denominators is , two positive terms survive at the start and two negative terms survive at the end.
Example 5: The Recursive Fixed Point Limit
Problem: A sequence is defined by and . Assuming the sequence converges, find its limit.
Solution: At infinity, both and become indistinguishable from the limit .
Example 6: The Arithmetico-Geometric Series (AGS)
Problem: Evaluate the infinite sum .
Solution: Write out the first few terms to see the structure:
Multiply the entire sum by the common geometric ratio :
Subtract the shifted sum from the original sum. Notice how aligning the denominators causes the arithmetic numerator to drop to a constant :
The right side is now a pure geometric series summing to .
Example 7: Radical Telescoping
Problem: Evaluate .
Solution: Rationalize the denominator by multiplying by the conjugate :
Now write out the telescoped sum:
The middle collapses entirely, leaving only .
Example 8: Solving a Linear Recurrence
Problem: A sequence is defined by , and . Find an explicit formula for .
Solution: Set up the characteristic equation:
Factoring yields , so the roots are and . General solution: . Using initial conditions: . Explicit formula: .
Example 10: Where the Telescoping Method is NOT Obvious
Problem: Evaluate .
Solution: Unlike standard partial fractions, this numerator looks troublesome. However, look for the derivative or a difference of squares in the numerator. Notice that . Rewrite the fraction:
The fraction telescopes perfectly!
The sum completely collapses to .
Example 11: Summation by Pairing
Problem: Evaluate .
Solution: While you could expand this into and use power formulas, you can also recognize pairing symmetry. Let the sum be . 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:
This reduces the computational load and minimizes arithmetic errors during contests.
Example 12: Sequence as a Polynomial Difference
Problem: If , find the degree of the sequence .
Solution: Evaluate the difference explicitly:
The sequence is a quadratic polynomial. Taking the difference of any polynomial sequence lowers its degree by exactly 1.
Example 13: The Synthesis
Problem: Evaluate .
Solution: Generate a telescoping form by rewriting the numerator:
Simplify the left fraction by cancelling :
We have successfully engineered a perfect telescoping series! Now write out the sum:
Every intermediate term cancels, leaving .
Practice Problems
| Status | Source | Problem Name | Difficulty | Tags | ||
|---|---|---|---|---|---|---|
| AMC 10 | Hard | Show TagsRecursion, Sequences | ||||
| AIME | Hard | Show TagsSeries | ||||
| Own | Hard | Show TagsArithmetic-Geometric Mean, Recursion | ||||
| Own | Normal | Show TagsSummation, Telescoping Series | ||||
| Own | Hard | Show TagsFloor Function, Number Theory, Sequences | ||||
| Berkeley Math Circle | Hard | Show TagsSequences and Series | ||||
| MathNet | Hard | Show TagsSequences and Series, Simple Equations | ||||
| USA IMO 2003 | Hard | Show TagsInduction / smoothing, Invariants / monovariants, Sequences and Series | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsSequences and Series | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsQuadratic functions, Sequences and Series | ||||
| Team Selection Test | Hard | Show TagsInvariants / monovariants, Sequences and Series | ||||
| IMO 2009 | Hard | Show TagsSequences and Series | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsAlgebraic properties of binomial coefficients, Generating functions, Sequences and Series | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsComplex numbers, Sequences and Series | ||||
| HMMT 2013 | Hard | Show TagsLinear and quadratic inequalities, Sequences and Series | ||||
| HMMT | Hard | Show TagsSequences and Series | ||||
| AMC 10 A | Hard | Show TagsFactorization techniques, Sequences and Series | ||||
| AMC 10 A | Hard | Show TagsSequences and Series, Simple Equations | ||||
| HMMT February 2025 | Hard | Show TagsGreatest common divisors (gcd), Sequences and Series | ||||
| Berkeley Math Circle | Hard | Show TagsSums and products, Telescoping series | ||||
| Berkeley Math Circle Take-Home Contest #6 | Hard | Show TagsInduction / smoothing, Polynomial operations, Sums and products, Telescoping series | ||||
| Berkeley Math Circle Monthly Contest 4 | Hard | Show TagsSums and products, Telescoping series | ||||
| MathNet | Hard | Show TagsSums and products, Telescoping series | ||||
| Berkeley Math Circle Monthly Contest 5 | Hard | Show TagsRecurrence relations, Telescoping series | ||||
| MathNet | Hard | 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.
