fibonacci-numbers

fibonacci-numbers什么意思,fibonacci-numbers翻译

基本解释

网络: 斐波纳契数列；斐波那契数列；费氏数列

例句

• Then we say that for any other natural number, that fibonacci number is the sum of the previous two fibonacci numbers.

  然后就是对其他自然数，其fibonacci数就是它前面两个数字的和，即F（N）=F（N-1）+F（N-2）。

• The result is all of the Fibonacci numbers less than 4 million and even.

  结果得到的是所有小于400万且为偶数的Fibonacci数。

• 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）。

• The Fibonacci numbers form an infinite sequence, so it should be described as such using Clojure"s infinite lazy sequences.

  Fibonacci数形成了一个无穷序列，所以应该用Clojure的无穷惰性序列描述它，如清单5所示。

• So the first two Fibonacci numbers are given, and each remaining number is the sum of the previous two.

  因此斐波那契数列的头两项数字是给定的，而之后的每个数字是前两项数字之和。

• Fibonacci numbers only have meaning in their proper order. Otherwise they"re mathematical gibberish12.

  斐波那契数字只有按顺序排列才有意义，否则他们在数学上就是杂乱无章的。

• When you are through , you will have an application that computes Fibonacci numbers asynchronously .

  演练时，将有一个异步计算斐波那契数列的应用程序。

• By definition, the first two Fibonacci numbers are 0 and 1, and each remaining number is the sum of the previous two.

  根据定义，斐波那契的前两项数字为0和1，之后的每个数字是前两项数字之和。

• You can arrange the layout in different ways according to Fibonacci numbers.

  你可以根据斐波那契序列的数字来安排不同的页面布局方式。

• Now that we have a good way to generate Fibonacci numbers, let"s solve the problem.

  我们已经具备了一种很好的生成Fibonacci数的方式，让我们来解决这个问题。