JC1 · H2 Mathematics · Notes
Use data to recover a recurrence, work backwards, obtain a shifted GP, and solve limits, integer thresholds, periodic sums and nonlinear restrictions.
Recurrence Relations summary and formula sheet: every method on 3 pages
Mr Ian Ang’s summary of the whole recurrence relations chapter on three pages.
Page 1 of 3 Working with a recurrence Part 1: the basics
H2 Math summary notes
Recurrence Relations formulas and methods, section by section
Page 1 of 3Working with a recurrencePart 1: the basics
Recurrence relations and the GC: base terms and generating terms
- A recurrence relation gives in terms of earlier terms, with the base term(s). has one base term. has two.
- To list terms of on the GC: 1. MODE: 5th row, select SEQ.
- 2. Y=: type SEQ(); = 2nd 7, = X,T,,n.
- 3. , base term .
- 4. 2nd graph: the table of terms.
Behaviour of a sequence: term by term, then eventually
- Describe term by term: increases, decreases, alternates, or constant. Then describe eventually: converges to a constant, diverges to or .
- : use the GC table. increases and diverges to .
- , same rule: is a constant sequence and converges to .
- : alternates between and .
Finding unknowns: from a later term, for convergence, and on the GC solver
- Unknown first term: . Then , , , so and .
- Convergence: converges. : a constant sequence, . Then needs , so .
- Unknowns in a formula: . Then , , .
- GC simultaneous solver: .
- The sum: .
Limit of a recurrence: replace both by l and solve l = f(l)
- As : and . Replace both by and solve .
- Example: , terms positive. Then and .
- , so . is rejected (terms ): .
- Constant sequence: for all . The same equation gives its values.
Proving increasing or decreasing: three methods
- : . Show for .
- 1 graph: is above the axis for , so and .
- 2 graphs: is above for , so .
- 3 algebra: .
- Both factors are positive, so . Show the sign of each factor.
Page 2 of 3Harder patternsPart 2: harder patterns
The inverse relation problem: go backwards by switching the variable
| Value | ||
|---|---|---|
| 53 | ||
| 25 | ||
| 11 | ||
| 4 |
- Important: the GC goes forwards. But when a later term is given, go backwards: make the subject.
- Example: : find . Then .
- Switch variable: so .
- The table gives , , , .
- GC table of : the 4th term is .
Periodic sequences: period, remainder and complete cycles
- 1. Generate terms until the pattern repeats: that gives the period. 2. For a far term : period, use the remainder. 3. For a long sum: complete cycles, then leftovers.
- Example: gives : period .
- , so . A remainder means the last term of the cycle.
- One cycle: .
- .
AP, GP and a formula for u_n: constant difference, constant ratio and unrolling
- AP: , so is constant. GP: , so is constant.
- : let , so . This is a GP with ratio and , so and . Then .
- : , and with , a constant difference: an AP. Then .
- Unroll: gives .
- : find . .
- Then .
Page 3 of 3Pictures: cobweb and limits
Four behaviours drawn: u_n against n for increasing, constant, alternating and converging sequences
- Each dot is one term , drawn at its true place.
- gives : it increases and diverges to .
- with the same rule gives the constant sequence , which converges to .
- alternates between and .
- gives and converges to , shown by a dashed line at .
Periodic, drawn: one period bracketed and u_100 = u_1
- The graph plots for to .
- The values on the vertical axis are , and , and they repeat in that order: .
- One period, the first three dots, is bracketed and labelled one period.
- The period is : , so .
The cobweb to the limit: up to the curve, across to y = x
- The graph draws with the dashed line , for .
- Each step goes up to the curve, then across to .
- The steps are marked from to and onwards, and they close in on the point where the curve meets .
- This point is at , marked on the horizontal axis.
- .
Settling to a limit: dots decreasing to the dashed line l = 100
- The graph plots as dots for to about .
- The first dot is at on the vertical axis.
- A dashed line is drawn at .
- decreases towards .
Worked examples
Recurrence Relations worked examples
Mr Ian’s worked examples for the chapter, with the full working.
Generate terms using the stated starting index
A recurrence defines each term using earlier terms. Write the base term and its index before calculating. In a model, distinguish the initial reading u₀ from the first yearly reading u₁. Describe both the direction of change and whether the sequence converges, diverges, alternates or is periodic.
Use consecutive readings to find the rule
Find constants, then work backwards
A tank is monitored once an hour. Its readings satisfy , with . Find and the initial reading .
Use each reading as the input to the next:
Subtract (2) from (1), then substitute:
Make the earlier reading the subject:
Thus . Forward substitution gives , checking both the rule and the index.
Subtract the limit to obtain a GP
Find a formula and the first reading below a threshold
For the same tank, find , describe the long-term behaviour and find the first integer hour at which the reading is less than 51.
First find the fixed value :
Subtract 50 from both sides of the recurrence:
So is a GP starting at , with common ratio .
The positive excess above 50 halves each hour. Hence decreases and converges to 50, while remaining above 50.
The first integer hour is 9. At hour 8 the reading is exactly 51, which fails the strict inequality; at hour 9 it is 50.5.
Follow the reading hour by hour
At hour 3, U₃ = 82. The excess above 50 is 32.
The multiplier decides the behaviour
Compare starting values in an unstable model
A sequence satisfies and . Describe its behaviour for , and find .
For , the terms increase and diverge to . For , every term is 4. For , the terms decrease and diverge to . Solving alone gives the possible limit 4; it does not prove convergence from an arbitrary starting value.
There are 10 selected terms. Their exponential parts have first term and common ratio :
Check : the sum becomes .
Variation: a negative multiplier alternates about the limit
For with , the fixed value is 4.
The sequence alternates about 4 and converges to 4. “Alternates” describes the error's sign; the terms themselves remain positive.
A repeated term can start a complete cycle
Count complete cycles and leftover terms
Let and . Find and .
Since the same deterministic rule is applied again, the three non-zero terms repeat. The period is 3.
A remainder of zero means the last term in a cycle, not a nonexistent . A periodic sequence with unequal repeating values does not converge to one limit.
Check that a nonlinear recurrence stays defined
A forbidden starting value and a constant sequence
Let and . Explain why does not define an infinite sequence, and find all constant sequences.
Then is undefined. Hence this starting value cannot generate an infinite sequence. Checking only would miss the later failure.
For a constant sequence all terms equal the same non-zero :
Both values are valid and remain unchanged under the rule.
Prove a direction of change on a stated interval
A local sign conclusion is not a global claim
A sequence satisfies . Assuming it converges to , find the possible limits. Show that if , then .
On , the first factor is positive and the second negative. Thus , as required.
This result is conditional on the current term being in that interval. It does not prove every later term remains there: for example, gives . To claim a whole sequence is decreasing, first establish the required bounds for all its terms.
Before you finish
- Did you use the given starting index?
- Does a proposed infinite sequence ever meet an undefined denominator?
- Have you justified convergence before treating a fixed-point equation as the actual limit?
- For selected terms or periodic sums, did you count terms and leftovers correctly?