MCQIndia.comCBSE
CBSE
Class 9 · Mathematics

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

Revision notes, worked problems, a question bank, assertion and reason questions and answers to the NCERT exercises. Tap a group to open it; opening one closes the others.

8.1–8.3Sequences and rulesExplicit and recursive rules

What is a sequence?

1361015
The first five triangular numbers: 1, 3, 6, 10, 15 dots.
  • A sequence is an ordered list of numbers; each number is a term. t₁, t₂, t₃, … name the terms (other letters s, u, V work too). It can be finite (6, 12, 24, 48, 96) or infinite.
  • Natural numbers 1, 2, 3, …; odd numbers 1, 3, 5, …; triangular numbers 1, 3, 6, 10, 15, …; square numbers 1, 4, 9, 16, 25, …
  • Triangular numbers: the nth term is 1 + 2 + … + n. Square numbers: 1 + 3 + 5 + … (sum of odd numbers). Terms may be fractions or negative.

Explicit rule

  • An explicit rule gives tₙ from n: odd numbers uₙ = 2n − 1; sₙ = 5n − 2: 3, 8, 13, 18, …
  • Use it to find any term without the earlier ones, and to test whether a number is a term: solve tₙ = value; n must be a natural number.
  • Example: 137 = 2n − 1 gives n = 69, so 137 is the 69th odd number. For 5n − 2: 308 is the 62nd term; 471 is not (n = 94.6); 473 is the 95th.

Recursive rule

  • A recursive rule gives each term from earlier ones: t₁ = 1, tₙ = tₙ₋₁ + 3 (1, 4, 7, 10, …, explicit tₙ = 3n − 2).
  • u₁ = 1, uₙ = 2uₙ₋₁ + 3 gives 1, 5, 13, 29, 61, 125, 253, … (133 is not a term).
  • The Virahānka–Fibonacci sequence: V₁ = 1, V₂ = 2, Vₙ = Vₙ₋₁ + Vₙ₋₂: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, … (Virahānka, 7th century CE; Gopāla, Hemachandra; Fibonacci).
8.4Arithmetic progressions (AP)Constant difference d

Definition and nth term

  • An AP has a constant difference between consecutive terms: a, a + d, a + 2d, …
  • tₙ = a + (n − 1)d; recursive: t₁ = a, tₙ = tₙ₋₁ + d.
  • Squares pattern 1, 5, 9, 13, …: tₙ = 4n − 3. Taxi fare ₹200 + ₹40 per km: tₙ = 200 + 40n (₹600 for 10 km). 11, 7, 3, −1, … is an AP with d = −4.
  • Natural numbers (d = 1), odd numbers (d = 2) are APs; triangular, square and prime numbers are not.

Graph of an AP

123455101520(1, 1)(2, 5)(3, 9)(4, 13)(5, 17)xy
Fig. 8.4: the points of an AP lie on a straight line (tₙ = 4n − 3).
  • The points (n, tₙ) of an AP always lie on a line with slope d.
8.5Sum of the first n natural numbersReverse and add

The sum formula

2 × (1 + 2 + 3 + 4 + 5 + 6) = 6 × 7
Two staircases of 1 + 2 + … + 6 dots make a 6 × 7 rectangle.
  • Write S = 1 + 2 + … + n and again S = n + … + 2 + 1; add: 2S = n(n + 1). So Sₙ = n(n + 1)/2 (Āryabhaṭīya 2.19).
  • 1 + … + 10 = 55; 1 + … + 100 = 5050; S₂₀ = 210; S₅₀ = 1275; S₁₀₀₀ = 500500.
  • 25 + … + 58 = S₅₈ − S₂₄ = 1711 − 300 = 1411.
  • Also the sum of an AP can be written as (first + last)/2 × number of terms. Triangular numbers: tₙ = n(n + 1)/2 (t₁₀ = 55, t₁₇ = 153, t₈₀ = 3240).
8.6Geometric progressions (GP)Constant ratio r

Definition and nth term

  • A GP multiplies by a constant ratio: a, ar, ar², …; tₙ = a rⁿ⁻¹; recursive: t₁ = a, tₙ = r tₙ₋₁.
  • 3, 6, 12, 24, …: tₙ = 3 × 2ⁿ⁻¹. 5, 15/4, 45/16, … has r = 3/4. 1, −1, 1, −1, … has r = −1.
  • Test: all ratios tₙ₊₁/tₙ must be equal.
  • Points of a GP do not lie on a line; they grow (r > 1) or shrink (0 < r < 1) quickly.

Graph and bouncing ball

123451020304050(1, 3)(2, 6)(3, 12)(4, 24)(5, 48)xy
Fig. 8.9: a GP’s points curve upwards; they are not on a line.
  • A ball dropped from 24 ft rebounds to ¾ of the previous height: 18, 13.5, 10.125, 7.59, 5.70, 4.27, 3.20, … (a GP with a = 18, r = 0.75). After the 7th bounce it stays below 4 ft (1/6 of 24).

Fractals: Sierpiński triangle

Stage 0Stage 1Stage 2black triangles: 1, 3, 9
Sierpiński triangle: each shaded triangle is replaced by three smaller ones, so the count triples; the area is multiplied by ¾.
  • Number of black triangles: 1, 3, 9, 27, … = 3ⁿ (GP, r = 3).
  • Area (starting at 1): 1, ¾, 9/16, 27/64, … = (¾)ⁿ (GP, r = ¾), which tends to 0 as n grows.
  • Recursive: t₀ = 1, tₙ = 3tₙ₋₁; s₀ = 1, sₙ = ¾ sₙ₋₁.
RefFormula sheetKey results

Formulas

IdeaFormula
AP nth termtₙ = a + (n − 1)d
AP recursivet₁ = a, tₙ = tₙ₋₁ + d
Sum 1 + … + nn(n + 1)/2
GP nth termtₙ = a rⁿ⁻¹
GP recursivet₁ = a, tₙ = r tₙ₋₁
Triangularn(n + 1)/2
Fibonacci–VirahānkaVₙ = Vₙ₋₁ + Vₙ₋₂

Common slips

  • Using a + nd instead of a + (n − 1)d.
  • Treating a sequence as an AP or GP without checking the differences or ratios.
  • Accepting a non-integer n as a position.
  • Starting the Sierpiński count at stage 1 instead of stage 0.