- Foundation
- About 16 min
- 5 practice questions
Explicit and recursive rules for a sequence
Write and use an explicit rule tₙ in terms of n, decide whether a number belongs to a sequence, and generate terms from a recursive rule, including the Virahānka–Fibonacci sequence.
If something looks wrong, please tell us.
By the end of this lesson you can
- Use an explicit rule such as tₙ = 5n − 2 to find any term directly.
- Decide whether a given number is a term of a sequence, and find its position.
- Generate terms from a recursive rule, such as Virahānka's rule Vₙ = Vₙ₋₁ + Vₙ₋₂.
To find the 300th odd number by counting up from 1 would take a long time. A rule that connects a term to its position does it in one step. There are two kinds of rules, and each is useful in its own way.
Explicit rules
An explicit rule gives tₙ directly as an expression in n. For the odd numbers, tₙ = 2n − 1: t₁ = 2 × 1 − 1 = 1, t₂ = 3, t₃ = 5, and t₃₀₀ = 2 × 300 − 1 = 599 straight away, without knowing any earlier term.
Worked example 1: using an explicit rule
A sequence has sₙ = 4n + 3. (a) Write the first four terms. (b) Find the 50th term. (c) Is 251 a term? (d) Is 300 a term?
Working: (a) s₁ = 7, s₂ = 11, s₃ = 15, s₄ = 19. (b) s₅₀ = 4 × 50 + 3 = 203. (c) Solve 4n + 3 = 251: 4n = 248, n = 62. Since 62 is a counting number, 251 is the 62nd term. (d) Solve 4n + 3 = 300: 4n = 297, n = 74.25. A position must be a counting number, so 300 is not a term.
Worked example 2: a rule with n²
For tₙ = n² + 1, the first terms are 2, 5, 10, 17, 26. Is 145 a term? Working: n² + 1 = 145 gives n² = 144, so n = 12 (positions are positive). So 145 is the 12th term.
Recursive rules
A recursive rule gives the first term (or first few terms) and tells how each term is made from the ones before it. For 1, 4, 7, 10, 13, …: t₁ = 1 and tₙ = tₙ₋₁ + 3 for n ≥ 2. Here tₙ₋₁ means 'the term just before tₙ'. To use a recursive rule you must work through the earlier terms in order.
Worked example 3: generating terms
u₁ = 2 and uₙ = 3uₙ₋₁ − 1 for n ≥ 2. Find u₂ to u₅. Working: u₂ = 3 × 2 − 1 = 5; u₃ = 3 × 5 − 1 = 14; u₄ = 3 × 14 − 1 = 41; u₅ = 3 × 41 − 1 = 122. So the sequence starts 2, 5, 14, 41, 122.
Worked example 4: from recursive to explicit
t₁ = 5 and tₙ = tₙ₋₁ + 4. Find an explicit rule. Working: the terms are 5, 9, 13, 17, …; each is 4 more than the last, so tₙ is 5 plus (n − 1) fours: tₙ = 5 + 4(n − 1) = 4n + 1. Check: t₃ = 4 × 3 + 1 = 13.
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
The Virahānka–Fibonacci sequence
A recursive rule can use more than one earlier term. The most famous example is V₁ = 1, V₂ = 2 and Vₙ = Vₙ₋₁ + Vₙ₋₂ for n ≥ 3: each term is the sum of the two before it.
| n | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |
|---|---|---|---|---|---|---|---|---|---|---|
| Vₙ | 1 | 2 | 3 | 5 | 8 | 13 | 21 | 34 | 55 | 89 |
This sequence was studied by the scholar Virahānka in the 7th century CE while counting the rhythms of Prakrit poetry, and later by Gopāla and Hemachandra, before the Italian mathematician Fibonacci wrote about it around 1200 CE. It turns up in many places in mathematics and nature.
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.
Not every sequence has a simple rule. The primes 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, … follow no known formula that gives the next prime easily.
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, … .
Check your understanding
-
1. For the sequence tₙ = 3n − 7, what is t₁₂?
- 29
- 36
- 43
- 5
Show answer
Answer: A. t₁₂ = 3 × 12 − 7 = 36 − 7 = 29.
-
2. Which term of the sequence tₙ = 5n − 3 is 147?
- 29th
- 31st
- 30th
- 35th
Show answer
Answer: C. Solve 5n − 3 = 147: 5n = 150, so n = 30. 147 is the 30th term.
-
3. Is 100 a term of the sequence sₙ = 4n + 3?
- Yes, the 25th term
- Yes, the 24th term
- Yes, the 26th term
- No
Show answer
Answer: D. Solve 4n + 3 = 100: 4n = 97, n = 24.25. The position must be a counting number, so 100 is not a term (the 24th term is 99 and the 25th is 103).
-
4. A sequence has u₁ = 2 and uₙ = 2uₙ₋₁ + 1 for n ≥ 2. What is u₄?
- 11
- 23
- 17
- 47
Show answer
Answer: B. u₂ = 2 × 2 + 1 = 5, u₃ = 2 × 5 + 1 = 11, u₄ = 2 × 11 + 1 = 23.
-
5. In the Virahānka–Fibonacci sequence 1, 2, 3, 5, 8, 13, 21, …, what is the next term?
- 29
- 26
- 42
- 34
Show answer
Answer: D. Each term is the sum of the two before it: 13 + 21 = 34.
Sign in to keep track of the lessons you finish.