Listing 7. A Fibonacci sequence in fib.hs.
清单7. fib . hs中的Fibonacci序列。
We first get the infinite Fibonacci sequence.
我们首先获得一个无穷的Fibonacci序列。
He then applies this to the Fibonacci sequence generator.
他接下来将这个函数应用在斐波那契数列生成器上。
The pattern was about 137 degrees and the Fibonacci sequence was 2/5.
这个布局的夹角约为137度而斐波那契分数为2/5。
The example he USES is a function that generates a Fibonacci sequence.
他当时使用的例子，就是用递归生成一个斐波那契数列。
We prepared a sample PSD layout that is designed according to the Fibonacci sequence.
我们准备了遵照斐波那契序列原则设计的PSD格式版面设计示例。
Each new term in the Fibonacci sequence is generated by adding the previous two terms.
Fibonacci序列中的每个新的项都是其前面两项相加的结果。
When it comes to mathmatics, you do not need to stick to well-known Golden Ratio or Fibonacci sequence.
当谈到数学时，你无需遵循众所周知的黄金分割比率和斐波那契序列。
The amazing thing is that the mathematical fractions were the same numbers as the Fibonacci sequence!
令人惊讶的是这些分数的构成数字正是组成斐波那契数列的数字。
Definitions in mathematics are often given recursively. For instance, the Fibonacci sequence is defined recursively.
在数学定义中，递归是十分常见的，如fibonacci数列(斐波那契数列)。
The Fibonacci sequence, in which each new term is the sum of the preceding two, was introduced in Chapter 4, exercise 9.
斐波那契数列，就是新的项是前面两项的和，我们在第4章练习9中已经介绍过。
Thanks to the Fibonacci sequence you can easily find dead twigs and tumbleweeds with graduated tiers resembling a chandelier.
感谢斐波那契序列，你可以很容易发现枯枝与滚草的渐进层次非常类似于吊灯。
The judge later confirmed the existence of the code, and revealed that the Fibonacci sequence was indeed the secret to its solution.
之后，法官证实密码确实存在，并说明破解密码的方法就是斐波那契序列。
If you run this code with a larger number for the Fibonacci sequence index (say, 12), you'll end up watching output scroll by for a long time.
如果对大的斐波纳契数列(比如说12)使用这段代码，将会看到长时间的滚动输出。
The downside of layouts based on the Fibonacci sequence is that it’s difficult to use it if you are given certain fixed width layout dimensions (e.g.
基于斐波那契序列页面布局设计的缺点在于：如果你得到的是一个特定固定的尺寸宽度（例如1000px），那么就很难使用这种方法了。
This essay, based on a brief introduction to the golden section and the Fibonacci sequence, elaborates on the cultural significance of the former.
在简要介绍黄金分割与斐波那契级数的基础上，着重探讨了黄金分割的文化意义。
To test this preliminary logging code, I'll use a nicely recursive method, an implementation of the Fibonacci sequence calculation, as shown in Listing 4.
为了测试这段初步的日志记录代码，我将使用一个精巧的递归方法，它是斐波纳契数列计算的一个实现，如清单 4 所示。
Chapter Four: a generalization about three principles of mathematical logic in Satie's piano works Golden Section, Fibonacci Sequence, and Lucas Sequence.
第四章：概括萨蒂钢琴作品中的三种数理逻辑原则——黄金分割、斐波那契数列、卢卡斯数列。
This paper presents a new approach, Fibonacci sequence based on-line efficiency optimization control, for improving the efficiency of induction motor drive systems.
提出一种基于斐波那契数列的寻优方法来提高交流电机驱动系统的效率。
Sequential iteration: the Fibonacci sequence code is called iteratively multiple times to match the number of workers that were executed in the SPE and Pthread tests above.
序列迭代：多次调用Fibonacci序列代码，从而与上面的SPE和Pthread测试中执行的工作者线程匹配。
Again, notice that you need to be creative when using Fibonacci sequence in your designs, otherwise your designs will turn out to be too rigid and hence difficult to use and navigate.
再次要重申的是，在设计中使用斐波那契序列时需要保持创造性，否则你的设计将显得僵硬并且难以使用和导航。
To hasten this application, which becomes proportionally slower as you proceed further into the Fibonacci sequence, the costly rework of recalculating Fibonacci Numbers would have to be avoided.
要加快该应用程序(随着进一步执行Fibonacci序列，程序会随之变慢)，应该避免重新计算Fibonacci数字这样代价高昂的重复工作。
While counting his newborn rabbits, Fibonacci came up with a numerical sequence.
斐波那契提出了一个数字序列计数新生兔子。
The Fibonacci numbers are an integer sequence where for a given number, the Fibonacci value can be calculated using: F(n) = F(n-1) + F(n-2).
Fibonacci 数列是一种整数序列，可以使用以下算式计算各个 Fibonacci值：F(n) = F(n-1) + F(n-2)。
Fibonacci added the last two Numbers in the series together, and the sum became the next number in the sequence.
斐波那契将序列中的最后两位数字相加，用相加之作为序列的下一个数字。
Fibonacci added the last two Numbers in the series together, and the sum became the next number in the sequence.
斐波那契将序列中的最后两位数字相加，用相加之作为序列的下一个数字。
应用推荐