Revision notes

Chapter 2 Numbers and Sequences: 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

Euclid's division lemma and Euclid's division algorithm

Euclid's division algorithm for HCF(a, b), a > b

  1. Divide a by b Write a = bq + r, 0 ≤ r < b.
  2. Is r = 0? If yes, b is the HCF. Stop.
  3. If not, divide b by r The old divisor becomes the dividend, the remainder becomes the divisor.
  4. Repeat until the remainder is 0 The last non-zero divisor is the HCF.
The remainders keep getting smaller, so the process always stops.

Euclid's division lemma: a = bq + r, 0 ≤ r < |b|. Euclid's division algorithm: HCF(a, b) = HCF(b, r); repeat until r = 0, and the last divisor is the HCF.

— Euclid

Key takeaways: the remainder in a = bq + r is never negative and is less than |b|. Dividing by 2, 3 or 4 and listing the possible remainders proves statements about forms of integers. Euclid's algorithm finds an HCF by repeated division; for three numbers, apply it twice. Subtract the remainders first when a question gives remainders.

Read the full lesson

Lesson 2

Fundamental Theorem of Arithmetic and modular arithmetic

Every positive integer greater than 1 can be written as a product of primes in exactly one way, apart from the order of the factors.

— Fundamental Theorem of Arithmetic

Counting modulo 4 wraps around like a clock

  1. 0 4, 8, 12, … land here
  2. 1 5, 9, 13, … land here
  3. 2 6, 10, 14, … land here
  4. 3 7, 11, 15, … land here; the next step returns to 0

Then back to step 1: 0

Going backwards works too: −5 ≡ 3 (mod 4) because −5 = 4 × (−2) + 3.

Key takeaways: prime factorisation is unique, which gives HCF (smaller powers of common primes), LCM (greater powers of all primes) and quick answers about last digits. a ≡ b (mod n) means n divides a − b. Reduce numbers to remainders before adding, multiplying or raising to powers. Use mod 24 for hours and mod 7 for days.

Read the full lesson

Lesson 3

Sequences and arithmetic progressions

nth term of an A.P.: tₙ = a + (n − 1)d. Number of terms from a to the last term l: n = (l − a)/d + 1.

— Arithmetic progression

Checking whether a sequence is an A.P.

  1. Find t₂ − t₁ Subtract the first term from the second.
  2. Find t₃ − t₂ and t₄ − t₃ Keep subtracting consecutive terms.
  3. Are all the differences equal? Equal differences: an A.P. with that d.
  4. If any difference differs Not an A.P. (for example 2, 4, 8, 16).

Key takeaways: a sequence is a function on ℕ. In an A.P. each term is the previous term plus d, so tₙ = a + (n − 1)d. Two given terms give two equations in a and d. Use a − d, a, a + d for three terms with a known sum, and 2b = a + c to test three numbers.

Read the full lesson

Lesson 4

Sum of an arithmetic series and geometric progressions

Sₙ = n/2 [2a + (n − 1)d]. If the last term l is known: Sₙ = n/2 (a + l).

— Sum of an arithmetic series

nth term of a G.P.: tₙ = arⁿ⁻¹. Three non-zero numbers a, b, c are in G.P. if and only if b² = ac.

— Geometric progression

A.P. and G.P. side by side

  • Arithmetic progression
    • Add the same d each time
    • d = tₙ − tₙ₋₁
    • tₙ = a + (n − 1)d
    • Three terms: a − d, a, a + d
    • Test: 2b = a + c
  • Geometric progression
    • Multiply by the same r each time
    • r = tₙ ÷ tₙ₋₁
    • tₙ = arⁿ⁻¹
    • Three terms: a/r, a, ar
    • Test: b² = ac

Key takeaways: Sₙ = n/2[2a + (n − 1)d] = n/2(a + l); when solving for n, reject negative or fractional roots. tₙ = Sₙ − Sₙ₋₁. In a G.P. tₙ = arⁿ⁻¹; dividing two given terms removes a and gives a power of r. Use a/r, a, ar for three terms with a known product, and b² = ac to test three numbers.

Read the full lesson

Lesson 5

Sum of a geometric series and special series

Sₙ = a(rⁿ − 1)/(r − 1) when r ≠ 1 (or a(1 − rⁿ)/(1 − r)); Sₙ = na when r = 1. Sum to infinity: S∞ = a/(1 − r), valid only when −1 < r < 1.

— Geometric series
Formulas for special series
SeriesSumExample
1 + 2 + 3 + … + n = Σkn(n + 1)/21 + 2 + … + 80 = 80 × 81/2 = 3240
1 + 3 + 5 + … + (2n − 1)n²1 + 3 + … + 59 has 30 terms, sum 30² = 900
1² + 2² + … + n² = Σk²n(n + 1)(2n + 1)/61² + … + 15² = 15 × 16 × 31/6 = 1240
1³ + 2³ + … + n³ = Σk³[n(n + 1)/2]²1³ + … + 12³ = 78² = 6084

Which formula do I need?

  • Terms differ by a constant
    • Arithmetic series
    • Sₙ = n/2[2a + (n − 1)d]
  • Terms have a constant ratio
    • Geometric series
    • Sₙ = a(rⁿ − 1)/(r − 1); S∞ = a/(1 − r) if −1 < r < 1
  • Terms are k, k² or k³
    • Special series
    • Use Σk, Σk² or Σk³
  • Terms like 7, 77, 777
    • Rewrite with powers of 10
    • Then use a geometric series

Key takeaways: for a G.P., Sₙ = a(rⁿ − 1)/(r − 1) when r ≠ 1, and S∞ = a/(1 − r) only when −1 < r < 1. A recurring decimal is an infinite G.P. Rewrite 7 + 77 + … using powers of 10. Know Σk = n(n + 1)/2, Σ(2k − 1) = n², Σk² = n(n + 1)(2n + 1)/6 and Σk³ = [n(n + 1)/2]², and subtract two such sums when the series does not start at 1.

Read the full lesson

Privacy · Terms · Refunds · Delivery