Skip to main content

Fibonacci Sequence and Rabbit Problem

Hello friends hope you all are good , healthy and safe. 

In this Blog we will learn about fibonacci Sequence , golden ratio,relation between them , rabbit problem and many more.


Also known as Leonardo Bonacci, Leonardo of Pisa, or Leonardo Bigollo Pisano ('Leonardo the Traveller from Pisa'), was an Italian mathematician from the Republic of Pisa, considered to be "the most talented Western mathematician of the Middle Ages".
Fibonacci 

Greatest mathematician of the middle ages, Fibonacci. Fibonacci was born in pisa around 850 years ago. He was a famous Italian mathematician. In the year 1202 he finished his book "Liber Abeci".

The book of calculations that brought Arabic numerals to Europe, the zero one,two that we use today. Fibonacci also presented a growing rabbit population problem. And after solving this problem he derived the famous sequence of numbers that is named after him, The Fibonacci Sequence .

Recursion relation to find all the Fibonacci numbers using initial two numbers. Also observed the Fibonacci spiral which you will find in nature also.

Suppose you put a male-female pair of newly born rabbits in a field . Rabbits take a month to mature before mating. After one month , females gives birth to one male-female pair and then mate again. No rabbits die. How many rabbit pairs are there after one year?


To solve this, we construct table. At the start of each month, the number of young pairs, adult pairs, and total number of pairs are shown. At the start of January, one pair of young rabbits is introduced into the population. At the start of February, this pair of rabbits has became adult. At the start of March, this pair has given birth to a new pair of young rabbits. And so on.


  Observation Table
                          
The observation table shows Fibonacci’s rabbit population in each month of the year.
Now we define the Fibonacci numbers Fn to be the sum of total number of rabbit pairs at the start of the nth month. The number of rabbits pairs at the start of next year or the 13th month i.e january, F13 = 233, can be taken as the solution to Fibonacci’s puzzle.

Further observing the table of the Fibonacci numbers listed in observations Table , revels or discovers that these numbers satisfy the recursion relation given below,

Fn+1 = Fn + Fn−1

This recursion relation gives the next Fibonacci number as the sum of the preceeding two numbers.
To start this recursion sequence , we need to specify F1 and F2 that is initial data . In this Fibonacci’s rabbit problem, the initial month starts with only one rabbit pair so that F1 = 1.  This initial rabbit pair is newborn and young so they takes one month to mature before mating therefore F2 = 1.
The first few Fibonacci numbers, read from the table, are given by
1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, . . .
and has become one of the most famous sequences in mathematics.




Labels:

Comments

Post a Comment

Popular posts from this blog

Fibonacci Sequence Problem set 1

 Problems  1. The Fibonacci numbers can be extended to zero and negative indices using the relation Fn = Fn+2 − Fn+1 . Determine F0 and find a general formula for F−n in terms of Fn. Prove your result using mathematical induction. Solution: F0 = F2 − F1 = 0, F−1 = F1 − F0 = 1, F−2 = F0 − F−1 = −1, F−3 = F−1 − F−2 = 2, F−4 = F−2 − F−3 = −3, F−5 = F−3 − F−4 = 5, F−6 = F−4 − F−5 = −8. The correct relation appears to be F−n = (−1)^(n+1)×Fn                .............(1) We now prove equation (1) by mathematical induction. Base case: Our calculation above already shows that equation (1) is true for n = 1 and n = 2, that is, F−1 = F1 and F−2 = −F2. Induction step: Let us  assume that (1) is true for positive integers n = k − 1 and n = k. Then we have F−(k+1) = F−(k−1) − F(−k)     ..(from definition)                = (−1)^k×Fk−1 − (−1)^(k+1)×Fk           ...
Post a Comment
Read more

Fibonacci Sequence and Climbing Staircase problem

Hello Friends, So here is our next blog on Fibonacci  Sequence. In this blog I will introduce another problem whose solution is the Fibonacci Number. This problem is known as Climbing Staircase problem. The Question is How many ways one can climb staircase with n steps, taking one or two steps at a time ?? Questions Of Climbing Staircase  Eg. Suppose we have 3 steps to climb. So we have a Staircase, we climb it by taking one step , one step , one step or two step , one step or one step, two step. So If we have n-steps in Staircase , then how many different ways can we climb the Staircase? So to answer this question we could make a table, considering small numbers of steps i.e n = 1,2,3,4,5 And we can list the number of ways to climb the Staircase. So Observe the table first column is number of stairs or steps. Second column is the list of ways one can climb by taking one or two steps at a time. Third column a n   the total number of ways to climb Staircase. I hope y...
1 comment
Read more