Scribd
Upload
87 views16 pages

Math1 Part2

This document discusses the Fibonacci sequence and the Golden Ratio. It defines Fibonacci numbers as the sequence that begins with 1, 1, and each subsequent number is the sum of the previous two. The Golden Ratio is the limit of the ratio of consecutive Fibonacci numbers, approximately 1.618. It provides examples of using Binet's Formula to find specific Fibonacci numbers and represents numbers as the sum of Fibonacci numbers. The document concludes with practice problems involving the Fibonacci sequence and Golden Ratio.

Uploaded by

marco antigua
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
87 views16 pages

Math1 Part2

This document discusses the Fibonacci sequence and the Golden Ratio. It defines Fibonacci numbers as the sequence that begins with 1, 1, and each subsequent number is the sum of the previous two. The Golden Ratio is the limit of the ratio of consecutive Fibonacci numbers, approximately 1.618. It provides examples of using Binet's Formula to find specific Fibonacci numbers and represents numbers as the sum of Fibonacci numbers. The document concludes with practice problems involving the Fibonacci sequence and Golden Ratio.

Uploaded by

marco antigua
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/ 16

Mathematics

in the Modern
World
Presented by Kathleen Sarmiento
Lesson 2:
Fibonacci
Sequence and
Golden Ratio
Fibonacci was the name given to an Italian
Mathematician Leonardo Pisano which means Leonardo
of Pisa, because he was born in Pisa, Italy around 1175.
Fibonacci is the shortened word for the Latin term “filius
Bonacci”, which stands for “son of Bonaccio. “His father
name was Guglielmo Bonaccio.

The Fibonacci numbers are the numbers is the following


integer sequence : 1, 1, 2, 3, 5,8, 13, 21, 55, 89, 144, ....
The Fibonacci sequence exhibits the following
property.
1+1=2 𝑜𝑟 𝐹3=𝐹2+𝐹1
1+2=3 𝑜𝑟 𝐹4=𝐹3+𝐹2
2+3=5 𝑜𝑟 𝐹5=𝐹4+𝐹3
3+5=8 𝑜𝑟 𝐹6=𝐹5+𝐹4
The general rule is given by
𝐹1 = 𝐹2 ,
𝑭𝒏 = 𝑭𝒏−𝟏 + 𝑭𝒏−𝟐 𝑓𝑜𝑟 𝑛 ≥ 3

To find the 𝑛𝑡h Fibonacci number without using recursion formula,

Binet’s Formula is an explicit formula used to find the nth term of the
Fibonacci Sequence. Named after the mathematician Jacques Philippe
Mari Binet.
Example:
Determine the 10th, 25th and 30th term in a Fibonacci
sequence.

Solution:
Using recursive formula 𝑭𝒏 = 𝑭𝒏−𝟏 + 𝑭𝒏−𝟐
𝐹10 = 𝐹9+𝐹8
= 34 +21
= 55
Example:
Determine the 10th, 25th and 30th term in a Fibonacci
sequence.

Solution:
For finding 𝐹25 and 𝐹30 we will now use Binet’s
formula
Example:
Find and evaluate the following.
Use the Binet’s formula below

a. If 𝐹22 = 17,711, and 𝐹24 = 46,368 , what is 𝐹23?


b. Find 𝐹50.
The Golden Ratio [𝐏𝐡𝐢 = 𝝋]
The value approached by dividing two consecutive
Fibonacci numbers, that is 𝐵𝑖𝑔𝑔𝑒𝑟 𝐹𝑛/𝑆𝑚𝑎𝑙𝑙𝑒𝑟 𝐹𝑛 is called
the Golden ratio. It is symbolized by the Greek letter Phi “𝜑"
and is approximately equal to 1.6180339887.
The Golden Ratio [𝐏𝐡𝐢 = 𝝋]
PROBLEM SET #2

Use the concepts of Fibonacci sequence and Golden Ratio


which we learned in this lesson to help you work on the
following items.
1. 𝐹40
2. 𝐹30 + 𝐹35
3. 𝐹35/5
4. 2𝐹25 + 𝐹20
5. 4𝐹27 + 15
PROBLEM SET #2 cont…

Use the concepts of Fibonacci sequence and Golden Ratio


which we learned in this lesson to help you work on the
following items.
6. 𝝋(17)
7. 𝝋(18)
8. 𝝋(19)
9. 𝝋(20)
10. 𝝋(21)
PROBLEM SET #2 cont…

11 - 15. Write the following integers as the sum of at least 2 or


3 distinct Fibonacci numbers.
a. 19
b. 27
c. 68
d. 97
e. 146
Problem Set Rules
1. Write your name, course and
section
2. Use white or yellow paper only
3. Use black or blue ballpen only
4. Clear and clean handwriting
5. Provide complete solution, no
solution no points.

You might also like