Revision notes

Chapter 8 Predicting What Comes Next: Exploring Sequences and Progressions: Foundation

The key points, rules to remember, tables and diagrams from all 5 lessons, on one page for quick revision. To keep a copy, use your browser's Print and choose "Save as PDF".

Lesson 1

Sequences and terms: patterns in numbers

Familiar sequences from earlier classes
SequenceNameDifferences between terms
1, 2, 3, 4, 5, 6, …Natural numbers1, 1, 1, 1, …
1, 3, 5, 7, 9, 11, …Odd numbers2, 2, 2, 2, …
1, 3, 6, 10, 15, 21, …Triangular numbers2, 3, 4, 5, …
1, 4, 9, 16, 25, 36, …Square numbers3, 5, 7, 9, …

Kinds of sequences

  • By length
    • Finite: stops, e.g. 6, 12, 24, 48, 96
    • Infinite: goes on, e.g. 1, 2, 3, …
  • By direction
    • Increasing: 1, 4, 9, 16, …
    • Decreasing: 1, 1/2, 1/3, 1/4, …
    • Neither: 1, −1, 1, −1, …
  • By rule
    • A clear rule: −7, −3, 1, 5, … (add 4)
    • No simple rule: 2, 3, 5, 7, 11, … (primes)

1 + 2 + 3 + … + n is the nth triangular number. 1 + 3 + 5 + … (n odd numbers) = n², the nth square number.

Key takeaways: a sequence is an ordered list of terms, finite or infinite; tₙ is the term in position n. Looking at the differences between consecutive terms is a good first step to spot a pattern. Triangular numbers are sums 1 + 2 + … + n, and square numbers are sums of the first n odd numbers.

Read the full lesson

Lesson 2

Explicit and recursive rules for a sequence

Two ways to describe a sequence

  • Explicit rule
    • tₙ is given in terms of n
    • Any term directly, e.g. t₁₀₀₀
    • Easy to test whether a number is a term
    • Example: tₙ = 3n − 2
  • Recursive rule
    • First term(s), then how each term follows from earlier ones
    • Needs all earlier terms
    • Often matches how a pattern grows
    • Example: t₁ = 1, tₙ = tₙ₋₁ + 3
Each term from V₃ on is the sum of the two before it
n12345678910
Vₙ123581321345589

Explicit rule: tₙ is a formula in the position n. Recursive rule: give the starting term(s), then a rule for tₙ using earlier terms.

Key takeaways: an explicit rule tₙ = (expression in n) gives any term directly; to test whether a number is a term, solve tₙ = number and check that n is a counting number. A recursive rule starts from given terms and builds each new term from earlier ones, as in Virahānka's sequence 1, 2, 3, 5, 8, 13, … .

Read the full lesson

Lesson 3

Arithmetic progressions: a constant difference

An AP with first term a and common difference d is a, a + d, a + 2d, a + 3d, … . Its nth term is tₙ = a + (n − 1)d. Recursively, t₁ = a and tₙ = tₙ₋₁ + d.

Check that every difference is the same
SequenceAP?ad
3, 7, 11, 15, …Yes34
11, 7, 3, −1, −5, …Yes11−4
1.5, 3.5, 5.5, 7.5, …Yes1.52
1, 3, 6, 10, …No: differences 2, 3, 4––
2, 4, 8, 16, …No: differences 2, 4, 8––

Solving an AP problem

  1. Find a and d d = any term minus the one before it.
  2. Write tₙ = a + (n − 1)d Simplify to the form (something) × n + (something).
  3. Use it Put in n to find a term, or solve tₙ = value to find a position.
  4. Check The position must be a counting number.

Key takeaways: an AP has a constant difference d. Its nth term is a + (n − 1)d and its recursive rule is tₙ = tₙ₋₁ + d. To find a position, solve tₙ = value and check n is a counting number; to count terms, find the position of the last term. Graphed against n, an AP lies on a straight line.

Read the full lesson

Lesson 4

Adding up: the sum of the first n natural numbers

Sₙ = 1 + 2 + 3 + … + n = n(n + 1) ÷ 2. This is also the nth triangular number.

The pairing method

  1. Write the sum forwards S = 1 + 2 + … + n
  2. Write it backwards S = n + (n − 1) + … + 1
  3. Add column by column Every column gives n + 1, and there are n columns.
  4. Halve 2S = n(n + 1), so S = n(n + 1) ÷ 2.

Sum of an AP = (number of terms) × (first term + last term) ÷ 2.

Some useful sums of the first n natural numbers
n102050100
Sₙ = n(n + 1) ÷ 25521012755050

Key takeaways: writing a sum forwards and backwards pairs equal totals, giving 1 + 2 + … + n = n(n + 1)/2, the nth triangular number. A sum of consecutive numbers is a difference of two such sums, or (number of terms) × (first + last) ÷ 2, and that rule works for every AP.

Read the full lesson

Lesson 5

Geometric progressions, fractals and bouncing balls

A GP with first term a and common ratio r is a, ar, ar², ar³, … . Its nth term is tₙ = arⁿ⁻¹. Recursively, t₁ = a and tₙ = r × tₙ₋₁.

To test for a GP, divide each term by the one before
SequenceRatiosGP?r
2, 6, 18, 54, …3, 3, 3Yes3
64, 48, 36, 27, …3/4, 3/4, 3/4Yes3/4
1, −1, 1, −1, …−1, −1, −1Yes−1
2, 4, 6, 8, …2, 3/2, 4/3No (it is an AP)–
Two GPs from one picture
Stage n01234n
Black triangles13927813ⁿ
Black area (stage 0 = 1)13/49/1627/6481/256(3/4)ⁿ

Arithmetic and geometric progressions

  • AP
    • Add the same number d each time
    • tₙ = a + (n − 1)d
    • Points (n, tₙ) lie on a straight line
    • Example: 3, 7, 11, 15, …
  • GP
    • Multiply by the same number r each time
    • tₙ = arⁿ⁻¹
    • Points (n, tₙ) lie on a curve, not a line
    • Example: 3, 6, 12, 24, …

Key takeaways: a GP multiplies by a common ratio r each step; tₙ = arⁿ⁻¹ and tₙ = r × tₙ₋₁. Test a sequence by dividing consecutive terms. With r > 1 the terms grow faster and faster; with 0 < r < 1 they shrink towards 0. Fractals like the Sierpiński triangle and bouncing balls give natural GPs, and their graphs curve rather than lie on a line.

Read the full lesson

Privacy · Terms · Refunds · Delivery