Scribd
Upload
8 views2 pages

3_-_fibonacci_sequence___recursive_formula_solutions

The document discusses the Fibonacci sequence and recursion, illustrating how sequences appear in nature, such as in honeybee generations. It provides exercises to identify patterns in sequences, derive recursive formulas, and calculate terms based on previous values. Key concepts include the definition of recursive sequences and the importance of known terms in forming recursive formulas.

Uploaded by

princesscole2006
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views2 pages

3_-_fibonacci_sequence___recursive_formula_solutions

The document discusses the Fibonacci sequence and recursion, illustrating how sequences appear in nature, such as in honeybee generations. It provides exercises to identify patterns in sequences, derive recursive formulas, and calculate terms based on previous values. Key concepts include the definition of recursive sequences and the importance of known terms in forming recursive formulas.

Uploaded by

princesscole2006
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MCR3U1 Date: ___________________

Day 3: Fibonacci Sequence & Recursion Chapter 7: Sequences and Series

The FIBONACCI SEQUENCE and RECURSION

There are many examples of sequences in nature, and in our everyday lives. A female honeybee hatches
from an egg laid by a female honeybee, after the egg has been fertilized by the male. So each female
honeybee has two parents. However, a male honeybee hatches from an unfertilized egg and has only one
parent, a female honeybee. The tree diagram shows six generations of a typical male honeybee.

1. Starting with the first generation, write the sequence of the number of honeybees in each generation.

2. Identify the pattern in this sequence.

3. Use this pattern to determine the next five terms of the sequence.

4. Let tn represent any term in this sequence. How could you represent the term before t n? How could
you represent the term before the term that is before tn?

5. Given that t1 = 1, t2 = 1, and n is a natural number, determine a formula for the general term of this
sequence.

Page | 1
MCR3U1 Date: ___________________
Day 3: Fibonacci Sequence & Recursion Chapter 7: Sequences and Series

Key Ideas
 In a recursive sequence, a new term is generated from the previous term or terms.
For example, 1, 2, -1, 3, -4, 7, -11, … is a recursive sequence because each term beginning with the
third term, is the result of subtracting tn - 1 from tn - 2 .

 A recursive formula shows how to find each term from the previous term or terms.
For example,
t1 = 1, t2 = 2, tn = tn - 2 - tn - 1 , where n is a natural number.
To find tn, subtract tn -1 from tn - 2 . The first two terms are given.
The sequence is 1, 2, -1, 3, -4, 7, -11, … .

 A recursive formula refers to at least one known term. The first term, and sometimes several
other terms, appear with the formula. Examine the formula carefully before applying it.

Ex1. Write the first four terms of each sequence.

a) t1 = 2, tn = 3tn - 1 + 5 b) t1 = -1, t2 = 1, tn = 2tn - 2 + 4tn - 1

Ex2. Write a recursive formula for each sequence.

a) 1, 2, 4, 7, 11, 16 b) 4, 5, 20, 100, 2000, …

c) -400, 200, -100, 50, …

p. 447 #1ae, 2e, 3, 4, 5cd, 6, 10 Page 2

You might also like