Question

翻译一篇关于斐波那契数列的英语文章。

suppose that a certain breed of rabbit is infertile during its first month off life,but after two months and after every month thereafter each male-female pair of rabbits produces one additional male-female pairs.Starting with one newly-bornmale-female pair and assuming that no rabbit dies, how many rabbit pairs will there be at the beginning of the 7th month?
the promble can be solved using recursive thinking.let f(n)=the number of rabbit pairs at the beginning of the nth month.from the given information,the number of pairs at the beginning of the first month is
f1=1
at the beginning of 2nd month,that pair ,called it p1,has not yet produced,so
f2=1
these are the initial conditions.
Now by the beginning of the 3rd month,P1 has produced off-spring which we will call P2.There are now two pairs ,so
f3=2
By the beginning of 4th month, P1 produces more offspring(call them
P3)but P2 is not yet fertile,so
F4=3
By the 5th month,both P1 and P2,the pairs alive in the 3rd month,are fertile,so
F5=F4+2=5
By the beginning of the 6th month ,the three pairs alive in the 4th month are fertile and producing, so
F6=F5+3=5+3=8
By the beginning of the 7th month,the five pairs are alive in the 5th month are fertile,so
F7=F6+5=8+5=13
In general, notice that the increase during each month is equal to the number of rabbit pairs that are alive at the beginning of the previous month.That is
(省略了一个表格）
This yields the recurrence relation
......
thus a recursive definition of F is
......
Now any terms of F can be found.The initial conditions are
F1=F2=1
From the recurrence relation,
......
And so on. the sequence F is called the Fobonacci sequence.Its terms are called Fibonacci numbers.

Answer 1

假设某一个品种的兔子在其小康生活的第一个月不育，但在两个月后，其后每月每男性对女性的兔产生一个新bornmale，对女性和一名男性，女性pairs.Starting假设没有兔子死亡，有多少兔子对会有在7月初？
该promble可以解决使用递归thinking.let F（下n）的=了在第n个month.from所提供的资料开始兔对数，对在第一个月开始数
车队= 1
在2月初，这对，称之为小，尚未产生，所以
F2代= 1
这些初始条件。
现在由3月初，小制作外的春天，我们将要求现在P2.There两对，所以
三级方程式= 2
截至4月初，小生产更多的后代（称之为
小三），但尚未P2是肥沃，因此，
F4类= 3
到了第5个月，P1和P2都在3月份对活着，是肥沃，因此，
F5键= F4类+2 = 5
到了6月初，三对活着的4个月的生育，生产，所以
于F6 = F5键+3 = 5 +3 = 8
到了7月初，五双活着的第5个月的肥沃，所以
F7键= F6键+5 = 8 +5 = 13
一般是，注意到，在每个月份增加等于兔对的数目在过去month.That开始活着
（省略了一个表格）
这就产生了递推关系
......
因此，F的递归定义
......
现在的F任何条款可以found.The初始条件
的F1 = F2代= 1
从递推关系，
......
等等。序列F是被称为Fobonacci sequence.Its条款被称为Fibonacci数。