论文标题
斐波那契和数字计算；计算数学反向工程的一个示例
Fibonacci and digit-by-digit computation; An example of reverse engineering in computational mathematics
论文作者
论文摘要
我们所有人都熟悉斐波那契数。它们经常出现在数学中，因此有很多日记和一系列专门用于研究的会议。但是，还有另一个与斐波那契有关的数字序列。在整数序列的在线百科全书中，数字序列是与立方多项式的真实根的近似值。斐波那契在1215年左右的手稿FLO中给出了序列中的前几个数字。斐波那契在最后一个数字中指出了一个错误，基于此错误，我们尝试了本文，以重建斐波那契使用的方法。斐波那契没有任何迹象表明他如何确定数字和识别可能的方法的问题是在1854年发表的第一个抄录版本后已经提出的。已显示其中两种方法可得出斐波那契的结果。在本文中，我们表明，第三种方法也给出了相同的结果，我们认为这是最可能的方法。
The Fibonacci numbers are familiar to all of us. They appear unexpectedly often in mathematics, so much there is an entire journal and a sequence of conferences dedicated to their study. However, there is also another sequence of numbers associated with Fibonacci. In The On-Line Encyclopedia of Integer Sequences, a sequence of numbers which is an approximation to the real root of the cubic polynomial. Fibonacci gave the first few numbers in the sequence in the manuscript Flos from around 1215. Fibonacci stated an error in the last number and based on this error we try, in this paper to reconstruct the method used by Fibonacci. Fibonacci gave no indication on how he determined the numbers and the problem of identifying possible methods was raised already the year after the first transcribed version of the manuscript was published in 1854. There are three possible methods available to Fibonacci to solve the cubic equation; two of the methods have been shown to give Fibonacci's result. In this paper we show that also the third method gives the same result, and we argue that this is the most likely method.
