Fibonacci数列,又叫“兔子数列”,产生于意大利数学家Fibonacci的一本《算盘书》中,记载了这样的问题: 兔子出生后两个月就能每月生小兔,若每次不多不少恰好生一对(一雌一雄),假如养了初生的小兔一对,试问一年后共有多少对兔子? 简单的推演后可以知道,该问题产生的数列如下:1,1,2,3,5,8,13,21,….其中每一个数都是前面相邻两数之和. The Fibonacci sequence, also known as the “rabbit sequence,” was produced in the Italian mathematician Fibonacci’s “Abacus Book.” This documented the problem: Two months after the rabbit was born, the bunny could be born every month, if not every time. Many of them happen to be just one couple (one female and one male). If you have a pair of newborn rabbits, how many pairs of rabbits do you have in one year? After a simple deduction, you can see that the number of questions produced is as follows: 1,1,2 ,3,5,8,13,21,.... Each of these numbers is the sum of the preceding two adjacent numbers.