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/ 8
THE FIBONACCI
SEQUENCE PRESENTED BY: ROGELIO GAURINO JR., JOHN MARK JARLEGO, JOHN ANTHONY GATON, CJ OFALSA, & JEDRICK VALENCIA HISTORY OF FIBONACCI SEQUENCE
• The Fibonacci Sequence is named for Leonardo Pisano (also
known as Fibonacci), an Italian mathematician who lived from 1170-1250. Fibonacci considered the sequence to be an answer to the following question: “How many pairs of rabbit will be produced in a year, beginning with a single pair, if in every month each pair which becomes productive from the second month on?” -The result can be expressed numerically as 1, 1, 2, 3, 5, 8, 13, 21, 34 ... • A Sanskrit grammarian, Pingala is credited with the first mention of the sequence of the number, sometime between the fifth century B.C and the second or third century A.D. since Fibonacci introduced the series to Western civilization, it has had a high profile from time to time. • Fibonacci numbers can also be used to define a spiral and are of interest to biologist and physicists because they are frequently observed in various natural objects and phenomena. • Fibonacci sequence is often associated with a golden ratio a proportion (roughly 1.618) that occurs frequently throughout the natural world and is applied across many areas of human endeavor. WHAT IS FIBONACCI SEQUENCE?
• It is a set of integers (the Fibonacci numbers) that starts with
a zero, followed by a one, and then by a series of steadily increasing numbers. The sequence follows the rule that each number is equal to the sum of preceding two numbers. • It begins with the following 14 integers: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233…… CALCULATING THE FIBONACCI SEQUENCE
• In this approach, each number in the sequence is considered a term,
which is represented by the expression Fn. The n reflects the numbers position in the sequence, starting with zero. • Using this numbering, the Fibonacci Sequence can be defined by the following three equations: -Fo = 0 (applies only on the first integer) -F1=1 (applies only to the second integer) -Fn= Fn-1+Fn-2 (applies to all other integers) Term Position Fn Value Fibonacci Number 1st F0 0 2nd F1 1 3rd F2 1 4th F3 2 5th F4 3 6th F5 5 7th F6 8 8th F7 13 9th F8 21 10th F9 34 11th F10 55 12th F11 89 13th F12 144 14th F13 233 • For example, the following calculation finds the Fibonacci number for the term in the tenth position (F9): Formula: Fn= Fn-1+Fn-2 F9=F9-1+F9-2+F8+F7=21+13=34 • The challenge with a recursive formula is that always relies on knowing the previous Fibonacci numbers in order to calculate a specific number in the sequence. SHORT QUIZ 1. What is the Fibonacci sequence? 2. What area the first three numbers in the Fibonacci sequence? 3. What is the formula for calculating the nth Fibonacci number? 4. What was Leonardo Pisano’s (Fibonacci’s) original problem involving the sequence? 5. Who is the Sanskrit grammarian that is credited to mention first the sequence of the Fibonacci number? 6. Who is Leonardo Pisano? 7. What is the proportion of the golden ratio in Fibonacci Sequence? (8-10). What are the three equations that is used in calculating the Fibonacci Sequence?