Chapter 8: Predicting What Comes Next
Exploring Sequences & Progressions
Complete study notes covering Sequences, Explicit & Recursive Rules, AP, GP, and the Virahānka–Fibonacci sequence — with examples, formulas, and exam questions.
➕ Arithmetic Progression
✖️ Geometric Progression
🔁 Recursive Rules
🔢 Sum of Natural Numbers
🔺 Fractals
8.1 Introduction to Sequences
We see patterns everywhere — in nature, art, music, and finance. In mathematics, a sequence is an ordered list of numbers (or terms) arranged in a particular order following a specific rule.
📌 Common Sequences You Already Know
| Sequence Name | Terms | Pattern |
|---|---|---|
| Natural Numbers | 1, 2, 3, 4, 5, 6, … | Add 1 each time |
| Odd Numbers | 1, 3, 5, 7, 9, 11, … | Add 2 each time |
| Triangular Numbers | 1, 3, 6, 10, 15, 21, … | Sum of 1+2+3+… up to n |
| Square Numbers | 1, 4, 9, 16, 25, 36, … | 1², 2², 3², n² |
A sequence is an ordered list of numbers. Each number is called a term. Sequences may be finite (e.g., 6, 12, 24, 48, 96) or infinite (indicated by …).
📝 Term Notation
We use subscript notation: t₁ = first term, t₂ = second term, tₙ = nth term.
Example: For odd numbers, t₁ = 1, t₂ = 3, t₃ = 5, t₄ = 7 …
Each triangular number is the sum of natural numbers up to that term. The 5th triangular number = 1 + 2 + 3 + 4 + 5 = 15. Square numbers = sum of consecutive odd numbers: 9 = 1 + 3 + 5.
8.2 Explicit Rule for a Sequence
An explicit formula uses the term’s position number n to directly calculate the value of that term — without needing to know previous terms.
📘 Example 1: Odd Numbers
Substituting: u₁ = 2(1)−1 = 1, u₂ = 2(2)−1 = 3, u₃ = 2(3)−1 = 5 ✓
You can find the 20th, 53rd, or 1000th term directly without computing all previous terms! For example, the 53rd odd number = 2(53)−1 = 105.
📘 Example 2: Sequence sₙ = 5n − 2
First 6 terms: s₁=3, s₂=8, s₃=13, s₄=18, s₅=23, s₆=28
Is 308 a term? Solve 5n − 2 = 308 → 5n = 310 → n = 62. ✅ Yes, it is the 62nd term.
Is 471 a term? Solve 5n − 2 = 471 → 5n = 473 → n = 94.6. ❌ Not a natural number, so 471 is NOT a term.
The subscript n must always be a positive integer (1, 2, 3, …). If solving gives a decimal or negative value, the number is NOT a term of that sequence.
🔢 Exercise: tn = 3n − 7
| n | 1 | 2 | 3 | 12 | 18 | 50 |
|---|---|---|---|---|---|---|
| tₙ | −4 | −1 | 2 | 29 | 47 | 143 |
Is 332 a term? 3n − 7 = 332 → n = 113. ✅ Yes, 113th term. | Is 557 a term? 3n − 7 = 557 → n = 188. ✅ Yes!
8.3 Recursive Rule for a Sequence
A recursive formula defines each term using the previous term(s). You need to know earlier terms to find the next ones.
📘 Example: Sequence 1, 4, 7, 10, 13, …
📘 Example 3: u₁ = 1, uₙ = 2uₙ₋₁ + 3
u₂ = 2 × 1 + 3 = 5
u₃ = 2 × 5 + 3 = 13
u₄ = 2 × 13 + 3 = 29
Sequence: 1, 5, 13, 29, …
📘 Example 4: s₁ = 3, sₙ = sₙ₋₁(sₙ₋₁ − 1)
s₂ = 3 × (3 − 1) = 6
s₃ = 6 × (6 − 1) = 30
s₄ = 30 × (30 − 1) = 870
Sequence: 3, 6, 30, 870, …
In a recursive formula, you MUST know the first term (or first few terms) to use the rule. Without the starting value, you cannot compute any other term!
Virahānka–Fibonacci Sequence
This is the most famous sequence involving a recursive rule with two previous terms:
V₄ = 3 + 2 = 5
V₅ = 5 + 3 = 8
Sequence: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, …
This sequence was first written down and studied by the Indian scholar Virahānka in his work Vṛttajātisamuchaya in the 7th century CE — in the context of Prakrit poetry and metre! It was further studied by Gopāla (c. 1135 CE) and Hemachandra (c. 1150 CE), and later by the Italian mathematician Fibonacci (c. 1200 CE). India did it first! 🇮🇳
The Virahānka–Fibonacci sequence appears in the spiral arrangement of seeds in sunflowers, the number of petals in flowers, the branching of trees, and many other natural phenomena. It plays an important role throughout mathematics and science.
8.4 Arithmetic Progressions (AP)
An Arithmetic Progression (AP) is a sequence in which the difference between any two consecutive terms is always constant. This constant is called the common difference (d).
📌 Examples of APs
| Sequence | First Term (a) | Common Diff. (d) | nth term formula |
|---|---|---|---|
| 1, 5, 9, 13, 17, … | 1 | 4 | 4n − 3 |
| 1, 4, 7, 10, … | 1 | 3 | 3n − 2 |
| 11, 7, 3, −1, −5, … | 11 | −4 | 15 − 4n |
| 2, 5, 8, 11, … | 2 | 3 | 3n − 1 |
📘 Recursive Rule for an AP
📘 AP on a Graph
When you plot the pairs (n, tₙ) for an AP, the points always lie on a straight line! This is because the nth term formula is linear (degree 1 in n). For GP, the points form a curve.
📘 Real-Life Example — Taxi Fare (Example 5)
Fixed booking fee: ₹200 | Rate: ₹40 per km
After 2 km: ₹200 + ₹80 = ₹280
After 3 km: ₹200 + ₹120 = ₹320
AP: 240, 280, 320, 360, … (a=240, d=40)
nth term: tₙ = 200 + 40n (n = km travelled)
After 10 km: t₁₀ = 200 + 400 = ₹600
Subtract any term from the next one. If the difference is the same throughout, it’s an AP. Example: 2, 5, 8, 11 → 5−2=3, 8−5=3, 11−8=3. ✅ AP with d=3.
8.5 Sum of the First n Natural Numbers
How to find the sum 1 + 2 + 3 + … + n without adding them all up?
🔢 The Clever Method (Gauss’s Trick)
S = 10 + 9 + 8 + … + 2 + 1
――――――――――――――――――――――――――――――――
2S = 11 + 11 + 11 + … + 11 (10 times)
2S = 110 → S = 55
The first known written record of this formula appears in Āryabhaṭa’s Āryabhaṭīya (Chapter 2, Verse 19). He described that the sum equals: (first term + last term) ÷ 2, multiplied by the number of terms — which is exactly the average of first and last, times n.
📌 Using the Formula
| Sum | Formula | Answer |
|---|---|---|
| S₁₀ | 10 × 11 / 2 | 55 |
| S₂₀ | 20 × 21 / 2 | 210 |
| S₅₀ | 50 × 51 / 2 | 1275 |
| S₁₀₀ | 100 × 101 / 2 | 5050 |
📘 Sum of Consecutive Numbers
To find 25 + 26 + 27 + … + 58:
= S₅₈ − S₂₄
= (58×59)/2 − (24×25)/2
= 1711 − 300
= 1411
The nth triangular number = Sₙ = n(n+1)/2. So the 10th triangular number = 10×11/2 = 55, the 17th = 17×18/2 = 153, the 80th = 80×81/2 = 3240.
8.6 Geometric Progressions (GP)
A Geometric Progression (GP) is a sequence in which each term is obtained by multiplying the previous term by a fixed constant. This constant is called the common ratio (r).
📌 Examples of GPs
| Sequence | a | r | nth term |
|---|---|---|---|
| 3, 6, 12, 24, 48, … | 3 | 2 | 3 × 2ⁿ⁻¹ |
| 1, 2, 4, 8, 16, … | 1 | 2 | 2ⁿ⁻¹ |
| 1, 3, 9, 27, 81, … | 1 | 3 | 3ⁿ⁻¹ |
| 1, −1, 1, −1, … | 1 | −1 | (−1)ⁿ⁻¹ |
| 5, 15/4, 45/16, … | 5 | 3/4 | 5 × (3/4)ⁿ⁻¹ |
📘 Recursive Rule for a GP
📘 GP vs AP on a Graph
AP points (n, tₙ) lie on a straight line. GP points lie on a curve (exponential shape). When r > 1, the curve rises steeply (exponential growth). When 0 < r < 1, it decreases toward 0 (exponential decay).
📘 Real-Life Example — Bouncing Ball (Example 10)
Ball dropped from 24 feet. Each bounce reaches ¾ (75%) of previous height.
2nd bounce: 18 × 0.75 = 13.500 ft
3rd bounce: 13.5 × 0.75 = 10.125 ft
4th bounce: 10.125 × 0.75 = 7.594 ft
5th bounce: 7.594 × 0.75 = 5.695 ft
GP: a = 18, r = 3/4
tₙ = 18 × (3/4)ⁿ⁻¹
1/6 of 24 = 4 ft → after 7th bounce: 3.20 ft < 4 ft ✓
Divide any term by the previous term. If the ratio is always the same, it’s a GP. Example: 3, 6, 12, 24 → 6/3=2, 12/6=2, 24/12=2. ✅ GP with r=2.
8.6.1 Fractals and Geometric Progressions
Fractals are shapes that repeat themselves at every scale — zoom in and you see the same pattern repeating infinitely. They are created using simple recursive rules but produce incredibly complex beautiful designs.
Start with an equilateral triangle (Stage 0). Join midpoints of all 3 sides → 4 smaller triangles → remove the central one. Repeat forever! Each black triangle is replaced by 3 smaller triangles in the next stage.
📌 Sierpiński Triangle — GP Patterns
| Stage (n) | 0 | 1 | 2 | 3 | 4 | n |
|---|---|---|---|---|---|---|
| Black triangles (tₙ) | 1=3⁰ | 3=3¹ | 9=3² | 27=3³ | 81=3⁴ | 3ⁿ |
| Shaded area (sₙ) | 1 | 3/4 | (3/4)² | (3/4)³ | (3/4)⁴ | (3/4)ⁿ |
tₙ = 3ⁿ (grows very fast!)
sₙ = (3/4)ⁿ (approaches 0!)
Fractals appear in: branching of trees, cauliflower and broccoli florets, snowflakes, coastlines, river networks, and even our lungs! The beautiful complexity comes from repeating a simple rule infinitely.
Chapter Summary — All Key Formulas at a Glance
An ordered list of numbers. Each number = a term. Can be finite or infinite.
Calculates tₙ directly using n.
Example: tₙ = 2n−1 (odd numbers)
Uses previous terms.
Example: t₁=1, tₙ=tₙ₋₁+3
V₁=1, V₂=2, Vₙ=Vₙ₋₁+Vₙ₋₂
Sequence: 1,2,3,5,8,13,21,…
tₙ = a + (n−1)d
Recursive: tₙ = tₙ₋₁ + d
Points lie on a straight line.
Sₙ = n(n+1)/2
= 1+2+3+…+n
Also = nth triangular number
tₙ = arⁿ⁻¹
Recursive: tₙ = r·tₙ₋₁
Points form a curve.
Sierpiński triangle:
triangles = 3ⁿ, area = (3/4)ⁿ
🗝️ AP vs GP — Side by Side
| Feature | AP | GP |
|---|---|---|
| Operation | Add/subtract constant d | Multiply by constant r |
| nth term | a + (n−1)d | arⁿ⁻¹ |
| Recursive | tₙ = tₙ₋₁ + d | tₙ = r·tₙ₋₁ |
| Graph shape | Straight line | Curve (exponential) |
| Example | 3, 7, 11, 15, … (d=4) | 2, 6, 18, 54, … (r=3) |
Exam Practice Questions with Solutions
🟢 Exercise Set 8.1 — Sequences & Explicit/Recursive Rules
🟡 Exercise Set 8.2 — Arithmetic Progressions
🔴 Exercise Set 8.3 — Geometric Progressions
⭐ End-of-Chapter Challenge Questions
Legend says the young Carl Friedrich Gauss (age 10) surprised his teacher by instantly adding 1 to 100. He mentally paired 1+100=101, 2+99=101, … giving 50 pairs × 101 = 5050. This is essentially the same trick as the formula Sₙ = n(n+1)/2, which Āryabhaṭa had already documented over 1000 years earlier!

Leave a Reply