Scribd
Upload
34 views

Fibonacci Reporting

Recursive sequence is a sequence where each term is defined by one or more previous terms. The Fibonacci sequence is an example of a recursive sequence, where each term is the sum of the previous two terms. The Fibonacci sequence was first described in Leonardo of Pisa's 1202 book Liber Abaci as a method to model the growth of a hypothetical population of rabbits based on breeding pairs.

Uploaded by

Kristine H. Sawisapagibig
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
34 views

Fibonacci Reporting

Recursive sequence is a sequence where each term is defined by one or more previous terms. The Fibonacci sequence is an example of a recursive sequence, where each term is the sum of the previous two terms. The Fibonacci sequence was first described in Leonardo of Pisa's 1202 book Liber Abaci as a method to model the growth of a hypothetical population of rabbits based on breeding pairs.

Uploaded by

Kristine H. Sawisapagibig
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

What is recursive sequence?

Recursive sequence is a sequence in which terms are defined using one or


more previous terms which are given.

(explaination) To expand, by combining the one and more previously defined term, you’ll get the terms
for recursive sequence.

One example of recursive sequence is the Fibonacci sequence.

Around 1200 AD, Leonardo of Pisa (1170 – 1250) published the Liber Abbaci or book of calculation. One
of the exercises in his book seems to have Leonardo’s own invention.

It is written like this, “A man put a pair of rabbits in a place surrounded on all sides by a wall. How many
pairs of rabbits are produced from that pair in a year? If it is supposed that very month each pair
produces new pair, which from second month onwards becomes productive?

(for clearer explanation) the relevance of Fibonacci sequence to the solution of the rabbit pattern is the
sequences serves as the guide to know how many rabbits will be produced in a year.

The Fibonacci sequence is the a series of numbers in which each number ( Fibonacci number ) is the
sum of the two preceding numbers.

(explanation) The Fibonacci numbers are the set of numbers in which each number is equal to the
sum of the two numbers before it.

Rules of Fibonacci

The Fibonacci numbers have the initial values F 0=0 F1 =1

This will come up to a formula F n=F n−1+ F n−2

Or simply the sequence is asking is just the sum of the last two terms. If it is asking the term F2
Then you will just add the last 2 terms.
Example:

Compute the Fibonacci numbers Fn for 0 ≤ n ≤ Fn is 3

So we are going to find the 3rd term.

To find the 3rd term, use this solution

𝐹3 = 𝐹𝑛−1 + 𝐹𝑛−2
𝐹3 = 𝐹3−1 + 𝐹3−2 = 𝐹2 + 𝐹1 (explanation) 3 minus 1 is 2 so it became F2 and 3 minus 2
is 1 so it became F1

𝐹2 = 1 𝑎𝑛𝑑 𝐹1 = 1 (explanation) add the values of the terms

Therefore, 𝐹3 = 1 + 1 = 2

The value of F3 = 2

Another example

: 𝐹4 = 𝐹𝑛−1 + 𝐹𝑛−2
𝐹4 = 𝐹4−1 + 𝐹4−2 = 𝐹3 + 𝐹2
𝐹3 = 2 𝑎𝑛𝑑 𝐹2 = 1 Therefore, 𝐹4 = 2 + 1 = 3

When we take any two successive (one after the other) Fibonacci Numbers, their
ratio is very close to the Golden Ratio:

A Golden Ratio can be broken into squares the size of the next Fibonacci number
down and below. If we are to take a golden rectangle, break it down into smaller squares
based on Fibonacci sequence and divide each with an arc, the pattern begins to take
shapes, we begin with Fibonacci spiral in which we can see in nature.

You might also like