FIBONACCI in English translation

• FIBONACCI

Examples of using Fibonacci in Chinese and their translations into English

数字是之前两个Fibonacci数字之和。
All others are the sum of the previous two fibonacci numbers.

Fibonacci堆利用另外一种方法解决了这个问题。
Fibonacci solves the problem a different way.

求出前几个Fibonacci数：In[1]:=.
I recognized the first Fibonacci numbers:: 1.

我们可以创建一个函数，将Fibonacci系列写入任意边界.
Let's write a function that prints Fibonacci series to a given boundary.

Fibonacci（1175～1250）是中世纪最杰出的数学家。
Leonardo Fibonacci(1175-1250) was the greatest European mathematician of the Middle Ages.

所以列奥纳多也得到了一个外号：Fibonacci，意思是Bonacci之子。
He is also called Fibonacci, i.e. son of Bonaccio.

Fibonacci是将有关数字系统的新观念带进欧洲的主要人物。
Fibonacci was one of the main people to bring these new ideas about the number system to Europe.

我开始通过画图来演示Fibonacci堆的关键操作是如何被应用在虚构的Fibonacci堆上。
I started by producing diagrams showing examples of the core Fibonacci heap operations being applied to imaginary Fibonacci heaps.

我们先来看一个经典的递归例子：斐波那契数列(Fibonacci)。
Now let's see another classic example: Fibonacci numbers.

价格走势目前正处于下行1.272FIbonacci延伸价位1.75美元的阻力位。
Price action is currently now trading at resistance outlined by the downside 1.272 FIbonacci Extension level priced at $1.75.

第一个任务是找到第一个Fibonacci数的索引，该数字有1000个数字。
The first task is to find the index of the first Fibonacci number, which has 1000 digits.

第一个任务是找到第一个Fibonacci数的索引，该数字有1000个数字。
It only asks to compute the index of a first Fibonacci number with 1000 digits.

因此Abruzzi后来一直在寻找Fibonacci,使他被迫加入目击证人保护计划。
Abruzzi subsequently put a hit out on Fibonacci, forcing Fibonacci to enter the Witness Protection Program.

我们已经具备了一种很好的生成Fibonacci数的方式，让我们来解决这个问题。
Now that we have a good way to generate Fibonacci numbers, let's solve the problem.

市场在长期下行1.272FIbonacci扩展水平（红色绘制）中找到了一些支撑，价格为73.85美元。
This is followed by the long-term downside 1.272 Fibonacci Extension level(drawn in blue) priced at $1.47.

这就意味着，计算fibonacci(n)的时间等于计算fibonacci(n-1)与fibonacci(n-2)的时间。
The reason is that calculating Fibonacci(N) requires all the work of calculating Fibonacci(N-1) and Fibonacci(N-2).

Fibonacci堆只是更复杂一点，但思想是一样的。
The Fibonacci heap is a little more complicated, but the idea is the same.

她说合并是一个新节点加入Fibonacci堆的方式。
She said that merge is the way that a new node is added to the Fibonacci heap.

所以在本例中，Fibonacci数一旦大于400万，我们就停止获取。
So in this case, as soon as we get a Fibonacci number greater than 4 million, we stop taking.

应用程序没有分析对象（例如，AndrewsPitchfork，FibonacciArcs等），但它们将在未来的程序构建中实现。
The application does not have analytical objects(for example, Andrews Pitchfork, Fibonacci Arcs etc.) but they will be implemented in one of the future builds.