Scribd
Upload
11 views

Recursive Sequences

Uploaded by

kaleb12345
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
11 views

Recursive Sequences

Uploaded by

kaleb12345
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Recursive Sequences

3
Exam Paper

Assessment Standard: 12.1.3


Correctly interpret recursive formulae

In this module we will introduce you Collect your Paper 3 Lessons every week!!
to an alternative method of writing down
the general term Tn of a number pattern Guys, both NSC and IEB examinations
or a sequence of numbers.
candidates have the option of writing Paper 3 at
This method, known as using a recursive the end of the year! Paper 3 covers additional
formula, is used in Computer Science mathematics material and is out of 100 marks.
and Advance Programme Mathematics in Maths Paper 3 will really set you apart in the
the Finance Module at school level. job market, and make studying technical subjects
at tertiary level easier. We have hooked you up
A recursive formula is different to our
other explicit formula, in that it expresses
with these lessons - written by IEB Maths
a given term Tn as a function which uses Paper 3 examiner Heather Frankiskos. Though
one or more of the previous terms. This the lessons apply to both IEB and NSC
means that you need to know at least the candidates,where there are differences, we will
term value immediately before the term point them out! The lesson this week applies to
you are trying to find, (which can be quite candidates from both
restrictive).
examining bodies. Give it a go!
Any recursive formula must have 2 parts:

• A starting value for at least T1


(and sometimes T2 ); and
• An equation for Tn as a function of Tn - 1
(or Tn + 1 as a function of Tn ).

Let us look at a recursive formula you should be familiar with: the one that generates the well-
known Fibonacci Sequence where each term in the sequence from T3 onwards is the sum of the
previous two terms.

1 ; 1 ; 2 ; 3 ; 5 ; 8 ; 13; ...

We would write this as

Tn+1 = Tn + Tn -1 (But we have to state that T1 = 1 and T2 = 1.)


If we state that T1 = 1 and T2 = 3 then the sequence generated by Tn+1 = Tn + Tn -1 would be:
1 ; 3 ; 4 ; 7 ; 11 ; 18 ; ... (Which is completely different)

1
Recursive Sequences
3
Exam Paper

Activity 1
If you are given a recursive formula you must be able to generate the sequence:

Example 1
Given T1 = 6 and Tn + 1 = Tn + 5 determine the first four terms of the sequence.

Solution:
T2 = T1 + 5 = 6+5 = 11
T3 = T2 + 5 = 11 + 5 = 16
T4 = T3 + 5 = 16 + 5 = 21

Therefore the sequence is: 6 ; 11 ; 16 ; 21; ...

Note:

• We could have written this in explicit form as, Tn = 5n + 6.


• This is a first order recursive formula using only one immediate term before it, and a constant
difference is added.
• If we needed T10 we would first need to work out T9 ; T8 ; T7 ; T6 ; T5 before it. Quite a mission!

Example 2
Given Tn + 1 = Tn + 2n with T1 = 3 determine the first four terms of the sequence.

Solution
T2 = T1 + 2 (1) = 3 + 2 = 5
T3 = T2 + 2 (2) = 5 + 4 = 9
T4 = T3 + 2 (3) = 9 + 6 = 15

Therefore the sequence is: 3 ; 5 ; 9 ; 15 ; ...

Which we know would be written in the explicit form as Tn = n2 – n + 3

Example 3
Find the next four terms of a sequence given

Tn + 1 = Tn +Tn -1 + 3 with T1 = 1; T2= 2

Note:

We must give the value of two previous terms to use this recursive formula.


Recursive Sequences
3
Exam Paper

Solution:
T3 = T2+ T1– + 3 = 2+ 1+3 = 6
T4 = T3 + T2 + 3 = 6+ 2+3 = 11
T5 = T4 + T3 + 3 = 11 + 6 + 3 = 20
T6 = T5 + T4 + 3 = 20 +11 + 3 = 34

Sequence is 1 ; 2 ; 6 ; 11 ; 20 ; 34 ; ...

Imagine trying to find T30 - not such fun! This is the drawback of the recursive formula

Activity 2
If you are given a recursive sequence you must be able to derive the formula:

Example 1
Consider the sequence: 2 ; -6 ; -14 ; -22 ; ... and give a recursive formula in the form Tn = ...

Solution:
T1 = 2
Tn = Tn - 1 – 8 for n ≥ 2 or T n+1 = Tn – 8 for n ≥ 1

Example 2
Consider the sequence: 2 ; 5 ; 6 ; 10 ; 15 ; 24 ; 38 ; 61 ; ...
and write down a recursive rule to describe Tn + 1 in terms of one or more of its preceding terms

Solution
Tn + 1=Tn + Tn – 1 – 1 for T1 = 2 and T2 = 5

Note:

From T3 onwards, each term is in the sum of the previous two terms, reduced by 1.


Recursive Sequences
3
Exam Paper

Example 3
1 ; 2 ; 2 ; 4 ; 8 ; 32 ; 256 ; . . . is a recursive sequence.
Write down the general rule in the form of Tn + 1 = ...

Solution
Notice that from T3 onwards, each term is the product of the previous two terms.

Tn + 1 = Tn x Tn – 1 ; T1 = 1 and T2 = 2

So you are now ready for an examination type question. This one combines explicit and recursive formula
so it should really test your understanding of this section.

Activity 3
Given the recursive rule Tn + 1 = Tn + 3n ; T1 = 1
a) Find the next four terms of the sequence
b) Hence give the explicit formula for this sequence in the form Tn = an2 + bn + c

Solution
a) T2 = 1 + 3(1) = 4
T3 = 4 + 3(2) = 10
T4 = 10 + 3(3) = 19
T5 = 19 + 3(4) = 31

So sequence is 1 ; 4 ; 10 ; 19 ; 31 ; ...

b) 1 ; 4 ; 10 ; 19 ; 31 ; ....

3 6 9 12

3 3 3
Now 2a = 3
a = _​ 2 ​
3

now T1 =​ _2 ​(1)2 + b(1) + c = 1 T2 = ​ _2 ​(2)2 + b(2) + c = 4


3 3
and
Solving for b and c we get b = -​ _2 ​and c = 1
3

_3
So Tn = ​ _2 ​n2 - ​ 2 ​n + 1 is the explicit formula
3

You might also like