全部

1·Listing 7. A Fibonacci sequence in fib.hs.

清单7 . fib . hs中的Fibonacci序列。

2·We first get the infinite Fibonacci sequence.

我们首先获得一个无穷的Fibonacci序列。

3·He then applies this to the Fibonacci sequence generator.

他接下来将这个函数应用在斐波那契数列生成器上。

4·The pattern was about 137 degrees and the Fibonacci sequence was 2/5.

这个布局的夹角约为137度而斐波那契分数为2/5。

5·The example he USES is a function that generates a Fibonacci sequence.

他当时使用的例子，就是用递归生成一个斐波那契数列。

6·We prepared a sample PSD layout that is designed according to the Fibonacci sequence.

我们准备了遵照斐波那契序列原则设计的PSD格式版面设计示例。

7·Each new term in the Fibonacci sequence is generated by adding the previous two terms.

Fibonacci序列中的每个新的项都是其前面两项相加的结果。

8·When it comes to mathmatics, you do not need to stick to well-known Golden Ratio or Fibonacci sequence.

当谈到数学时，你无需遵循众所周知的黄金分割比率和斐波那契序列。

9·The amazing thing is that the mathematical fractions were the same numbers as the Fibonacci sequence!

令人惊讶的是这些分数的构成数字正是组成斐波那契数列的数字。

10·Definitions in mathematics are often given recursively. For instance, the Fibonacci sequence is defined recursively.

在数学定义中，递归是十分常见的，如fibonacci数列(斐波那契数列)。