英语释义

1. an integer in the infinite sequence 1, 1, 2, 3, 5, 8, 13, … of which the first two terms are 1 and 1 and each succeeding term is the sum of the two immediately preceding

2. the mathematical sequence consisting of the Fibonacci numbers

片语

fibonacci search斐波纳契选法

FIBONACCI STUDIES斐波纳契研究

fibonacci sequence[数] 斐波纳契数列

Fibonacci QuarterlyThe Fibonacci Quarterly is a scientific journal on mathematical topics related to the Fibonacci numbers, published four times per year. It is the primary publication of The Fibonacci Association, which has published it since 1963.

Fibonacci sequence[数] 斐波纳契数列

Enter Fibonacci斐波那契数列

Fibonacci ratios费氏比例

Leonard Fibonacci费波纳奇

fibonacci sequences[数] 斐波纳契数列

fibonacci lines黄金分割线

英汉例句

• 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），那么就很难使用这种方法了。

• Listing 7. A Fibonacci sequence in fib.hs.

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

• 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)使用这段代码，将会看到长时间的滚动输出。

• We first get the infinite Fibonacci sequence.

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

• A new study* by Professor Roy Batchelor and Richard Ramyar of the Cass Business School, finds no evidence that Fibonacci numbers work in American stockmarkets.

  Cass商学院的RoyBatchelor和RichardRamyar教授，在一个新研究*中证实没有数据表明斐波纳契数对美国股市有作用。

• Figure 4 shows the Fibonacci trace highlighted in vim.

  图4显示了vim中加亮的Fibonacci跟蹤。

• In the Fibonacci sample given above, running the printfibo function in another process produced no useful return value.

  在上述Fibonacci样例中，在另一个进程内运行printfibo函数不会得到有用的返回值。

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

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

• The main idea behind such designs is to use Fibonacci when deciding on the dimensions for content area or sidebar.

  这种设计背后的主要思想在决定内容区域或侧边栏尺寸时利用斐波那契原理。

• Your first Erlang program, a recursive Fibonacci function.

  第一个Erlang程序，一个递归的fibonacci函数。

• Fibonacci Numbers only have meaning in their proper order. Otherwise they」re mathematical gibberish12.

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

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

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

• The classic Haskell functions that you」ll find in most tutorials are recursive math functions, such as Fibonacci functions and factorials.

  在大多数教程中可以发现的大多数经典Haskell函数都是递归的数学函数，例如fibonacci函数和阶乘。

• But dynamic programming is usually applied to optimization problems like the rest of this article's examples, rather than to problems like the Fibonacci problem.

  但是动态编程通常被用于最优化问题(比如本文后面的示例)，而不是像斐波纳契数这样的问题。

• I first completed testing using the Pthreaded code just to take a look at the speedup provided by the PPE symmetric multithreading to the Fibonacci worker threads.

  我首先使用Pthread代码进行完整的测试，以此了解PPE对称多线程给Fibonacci工作者线程提供的加速效果。

• An example of aggregate data after three runs of the Fibonacci Maker is shown in Figure 6.

  图6显示了三次运行FibonacciMaker之后数据合计的示例。

• So in this case, as soon as we get a Fibonacci number greater than 4 million, we stop taking.

  所以在本例中，fibonacci数一旦大于400万，我们就停止获取。

• Fibonacci kisses his three kids before he puts them to bed.

  Fibonacci亲吻了他的3个孩子，把他们哄上床睡觉。

• Fibonacci Numbers at least have the virtue of creating a testable proposition; one that they appear to fail.

  斐波纳契数的优点在于至少有可测试的主张；一个看起来错了的主张。

• You can think of factorials in much the same way as Fibonacci sequences.

  可以用与Fibonacci序列基本相同的方式对待阶乘。

• The font size also corresponds to a Fibonacci number.

  字体的大小也对应于一个斐波那契数。

• The result -- the 16th element in the Fibonacci series -- is shown in Figure 2.

  其结果 ——Fibonacci系列的第 16 个元素 ——如图2所示。

• 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.

  再次要重申的是，在设计中使用斐波那契序列时需要保持创造性，否则你的设计将显得僵硬并且难以使用和导航。

• This rule instructs make — if it wishes to build the target all — to first make sure that hello, goodbye, and Fibonacci are up to date.

  这条规则会告诉make——如果希望编译目标all——首先要确保hello、goodbye和fibonacci都是最新的。