... of the sequence is the sum of the preceding two. Therefore, the nth Fibonacci number is defined recursively as follows: y1 = y2 = 1 (1) yn = yn-1 + yn-2 n ? 3 Historically, this sequence appeared for the first time in a problem posed by the Italian scholar Leonardo Fibonacci in 1202. In his famous work Liber Abaci, Leonardo Fibonacci asked the following famous question on the rate growth of rabbits: Suppose that on January, 1st there are two newborn rabbits, one male and one female. What is the number of rabbits produced in a year if the following conditions hold: 1) each pair takes one month to reach maturity 2) each pair produces a mixed pair of rabbits every month, from February on; and 3) no rabbits die during the course of the year. Assume that on January 1st there is one mixed pair of baby rabbits. At the ...

See this essay or coursework document in full right now