Fibonacci and digit-by-digit computation; An example of reverse engineering in computational mathematics

by   Trond Steihaug, et al.

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.


page 1

page 2

page 3

page 4


Frobenius Numbers and Automatic Sequences

The Frobenius number g(S) of a set S of non-negative integers with 1 is ...

Epi-constructivism: Decidable sets of computable numbers as foundational objects for mathematics

It is well known that the R, the set of real numbers, is an abstract set...

On the Complexity of Computing Gödel Numbers

Given a computable sequence of natural numbers, it is a natural task to ...

Solution of Real Cubic Equations without Cardano's Formula

Building on a classification of zeros of cubic equations due to the 12-t...

Charles Babbage, Ada Lovelace, and the Bernoulli Numbers

This chapter makes needed corrections to an unduly negative scholarly vi...

Empirically Improved Tokuda Gap Sequence in Shellsort

Experiments are conducted to improve Tokuda (1992) gap sequence in Shell...

On the computational properties of the uncountability of the real numbers

The uncountability of the real numbers is one of their most basic proper...

Please sign up or login with your details

Forgot password? Click here to reset