0% found this document useful (0 votes)
466 views

WK14 GE4 Problem Solving With Pattern and With Strategies

The document discusses terms of sequences and the Fibonacci sequence. It defines what a term and sequence are, and how to denote terms. It explains how to use difference tables to predict subsequent terms. It also introduces the nth-term formula to find specific terms of a sequence given the formula. Finally, it defines the Fibonacci sequence recurrence relation and provides examples of computing Fibonacci numbers using the recurrence and Binet's formula.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
466 views

WK14 GE4 Problem Solving With Pattern and With Strategies

The document discusses terms of sequences and the Fibonacci sequence. It defines what a term and sequence are, and how to denote terms. It explains how to use difference tables to predict subsequent terms. It also introduces the nth-term formula to find specific terms of a sequence given the formula. Finally, it defines the Fibonacci sequence recurrence relation and provides examples of computing Fibonacci numbers using the recurrence and Binet's formula.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 15

Problem Solving with

Patterns
Terms of a Sequence
Term
• An ordered list of numbers such as 14, 27, 44, 65, ...

Sequence

• A sequence is a function whose domain is


the set of positive integers. It also means
an ordered list of numbers. Each number
in a sequence is called a term.
Terms of a Sequence

• 5, 14, 27, 44, 65, ...


• In the sequence 5, 14, 27, 44, 65, ... we denote the terms as follows:

a1 = 5 - First Term a4 = 44 - Fourth Term


a2 = 14 - Second Term a5 = 65 - Fifth Term
a3 = 27 - Third Term

an = nth term of a sequence


Terms of a Sequence
• What is the next term in the sequence 5, 14, 27, 44,
65, ...
To answer this question, we often construct a difference table.

sequence 5 14 27 44 65 ... 90 ...


+
first differences 9 13 17 21 25 ...
...

+
second differences4 4 4
Terms of a Sequence
• 2, 7, 24, 59, 118, 207, 332, ...

2 7 24 59 118 207 332 499 ...

5 17 35 59 89 125 167 ...

12 18 24 30 36 42 ...

6 6 6 6
Exercises: Terms of a Sequence

• Use difference table to predict the next term of the


sequence:

1. 1, 14, 51, 124, 245, 426, ...


2. 10, 10, 12, 16, 22, 30, ...
3. -1, 4, 21, 56, 115, 204, ...
4. 1, 7, 17, 31, 49, 71, ...
5. 0, 10, 24, 56, 112, 190, ...
6. 17, 15, 25, 53, 105, 187, ...
nth-term formula for a Sequence

• Find the first 5 term of the sequence given the nth term, an
= 3n2 + n

4 , 14, 30, 52, 80.


a1 = 3(1)2 + 1= 3(1) + 1 = 4
a2 = 3(2)2 + 2= 3(4) + 2 = 14
a3 = 3(3)2 + 3= 3(9) + 3 = 30
a4 = 3(4)2 + 4= 3(16) + 4 = 52
a5 = 3(5)2 + 5= 3(25) + 5 = 80
nth-term formula for a Sequence

• What is the nth term of the sequence 4, 10, 16, 22,


28...?,
an = a1 + (n - 1)d
a1 = 4 d=6

an = 4 + (n - 1)6
an = 4 + 6n - 6
an = 6n - 2
Exercises: nth-term formula for a
Sequence

• Use the given nth-term formula to compute the first five


terms of the sequence.

1. an = n(2n + 1)
2
2. an = n
n+1
3. an = 5n2 - 3n
4. an = 2n3 + n2
Fibonacci Sequence

• The Fibonacci Sequence is the series of numbers such


that the next number is found by adding up the two
numbers before it.
Fn = F(n-1) + F (n-2)

where:
Fn = is the term number “n”
F(n-1) = is the previous term (n-1)
F (n-2) = is the term before that (n-2)
Fibonacci Sequence
n 1 2 3 4 5 6 7 8 9 10 11 12 13 14 ...
Fn 1 1 2 3 5 8 13 21 34 55 89 114 233 377 ...

Find the 10th term in the Find the 13th term in the
Fibonacci sequence. Fibonacci sequence.

Fn = F(n-1) + F (n-2) Fn = F(n-1) + F (n-2)


F10 = F(10-1) + F (10-2) F13 = F(13-1) + F (13-2)
F10 = F(9) + F (8) F13 = F(12) + F (11)
F10 = 34 + 21 F13 = 144 + 89
= 55 = 233
Fibonacci Number General
Formula (Binet's Formula)

1 1 5 
n
 1  5  
n

Fn     
5   2   2  
  

• Find the F13 • Find the F25

1 1 5  1 5  
 25 25
1 1 5  1 5  
13 13

F13      F25     
5  2   2   5  2   2  
   

=233 =75,025
Properties of Fibonacci numbers

• Determine whether the statement is 3Fn - Fn-2 = Fn+2 for ≥ 3.


n 1 2 3 4 5 6 7 8 9 10 11 12 13 14 ...
Fn 1 1 2 3 5 8 13 21 34 55 89 114 233 377 ...

Fn+2 = 3Fn - Fn-2 Therefore the


F3+2 = 3F3 - F3-2 statement
F5 = 3(2) - F1 3Fn - Fn-2 = Fn+2 for ≥ 3
5= 6 - 1 is TRUE
5=5
Properties of Fibonacci numbers

• If n is even, then Fn is odd number.


n 1 2 3 4 5 6 7 8 9 10 11 12 13 14 ...
Fn 1 1 2 3 5 8 13 21 34 55 89 114 233 377 ...

If n is 2, then Fn is 1. Thus the statement “If


If n is 4, then Fn is 3. n is even then Fn is odd
number” is
If n is 6, then Fn is 8.
FALSE.
Thank you !!!

You might also like