Fibonacci leonardo (about 1170-1250) is a famous Italian mathematician. Among the many interesting questions in his book “Abacus Book”, the most successful one is the famous “Rabbit Reproduction Problem”: If each pair of rabbits breeds a pair of child rabbits every month, and the child rabbits are born in the second month after birth There is reproductive capacity, how many pairs of rabbits can a pair of rabbits reproduce in a year?
This question will form a Fibonacci sequence
| month | the number of rabbits already | New rabbit number | Total number of rabbits | Rabbit pairs< /span> | New rabbit logarithm |
| 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 |
So the rabbit logarithm is: 1, 2, 3, 5, 8, 13, 21,… plus 1 in front of it Is the Fibonacci sequence
The number of rabbits added each time is: 0,1,1,2,3,5, 8,…, deleting 0 before it is also the Fibonacci sequence
the Fibonacci of the rabbit total logarithm Sequence: 1,1,2,3,5,8,13,21,…
< span style="font-size: 14px;"> where n is the month.