Separately and recursive -Fibonacci columns rabbit problem

Pei Fibonacci (Fibonacci leonardo, about 1170-1250) is famous Italian mathematician. In many interesting questions "abacus book" in his book, the most successful of the question is the famous "Rabbit breeding problem": If every month rabbits breeding a pair of rabbit, rabbit and child after birth the second month have reproductive capacity, how much can one pair of rabbits a year of the rabbit breeding?

This issue will constitute a Fibonacci number

month For several rabbits The number of new rabbit The total number of rabbits Rabbit logarithmic Add the rabbit logarithmic
1 2 0 2 1 0
2 2 2 4 2 1
3 4 2 6 3 1
4 6 4 10 5 2
5 10 6 16 8 3
6 16 10 26 13 5
7 26 16 42 21 8

Therefore rabbit logarithm: 1,2,3,5,8,13,21, ... plus 1 is in its previous Fibonacci number

Each time the number of new Rabbit is: 0,1,1,2,3,5,8, ..., delete 0 in front is Fibonacci number

The total number of rabbits that deed Fibonacci number of columns: 1,1,2,3,5,8,13,21, ...

 

 

 Where n is the month.

 

Guess you like

Origin www.cnblogs.com/cherry0408/p/11597169.html