Leonardo Fibonacci Mathematician(1170? - 1250?

Pisa, now Italy)

or Leonardo Pisano Leonardo Filius Bonacci (Fibonacci, son of Bonacci) was a mathematician innovator in the s. XIII. It was a mathematical genius solitary flame during the Middle Ages. Passed to posterity by the publication in 1202 of his famous Liber Abacci where among other things introduced indu-Arabic numbering. Book that was not surpassed until several centuries later and that was followed was studied and mathematical inspiration to the present. Even today there is a Fibonacci Association which publishes the journal The Fibonacci Quarterly Fibonacci was born in Italy but was educated in North Africa where his father, Guilielmo, had a diplomatic post. His father's job was to represent the merchants of the Republic of Pisa operating in Bugia, later called Bougie and now called Bejaia. Bejaia is a Mediterranean port in northeastern Algeria. The city sits at the mouth of Wadi Soummam near Mount Gouraya and Cape Carbon. Fibonacci was taught mathematics in Bugia and traveled widely with his father and recognized the enormous advantages of the mathematical systems used in the countries he visited. Fibonacci ended his travels around 1200 and at that time he returned to Pisa. He wrote a number of important texts which played an important role in the awakening of ancient mathematical skills and made significant contributions of their own. Fibonacci lived in the days before printing, so his books were manuscripts and the only way to get a copy of one of them was to have made another manuscript copy. In his books we still have copies of Liber abaci (1202), Practice geometriae (1220), Flos (1225), and the Liber quadratorum. Given the relatively few manuscript copies that would have occurred, we

are fortunate to have access to his writings in these works. However, we know that he wrote some other texts, which, unfortunately, are lost. His book on commercial arithmetic Di minor guise is lost as his commentary on Book X of Euclid's Elements which contained a numerical treatment of irrational numbers which Euclid had approached from a geometric point of view. One can have thought that at a time when Europe was little interested in scholarship, Fibonacci would have been largely ignored. This, however, is not so and widespread interest in his work undoubtedly contributed strongly to its importance. Fibonacci was a contemporary of Jordan but he was a far more sophisticated mathematician and his achievements were clearly recognized, although they were more practical applications than the abstract theorems that made him famous to his contemporaries. The Emperor of the Holy Roman Emperor Frederick II era. He was crowned Holy Roman Emperor by the Pope in the Church of St. Peter in Rome in November 1220. Frederick II supported Pisa in its conflicts with Genoa at sea and with Lucca and Florence on land, and spent the years up to 1227 consolidating his power in Italy. State control was introduced on trade and industry, and were trained civil servants to oversee this monopoly at the University of Naples which Frederick founded for this purpose in 1224. Federico heard from Fibonacci's work through the scholars of his court who had corresponded with him since his return to Pisa around 1200. These scholars included Michael Scotus who was the court astrologer, Theodorus Physicus court philosopher and Dominicus Federico Hispanus who suggested him to meet Fibonacci when Frederick's court met in Pisa around 1225. Liber abaci, published in 1202 after Fibonacci's return to Italy, was dedicated to Scotus. The book was based on arithmetic and algebra that Fibonacci had accumulated during

his travels. The book, which became widely copied and imitated, presented the Hindu-Arabic decimal place-value and the use of Arabic numerals in Europe. In fact, although it is primarily a book about the use of Arabic numerals, which became known as 'algorism', simultaneous linear equations are also studied in this work. Certainly many of the problems that Fibonacci considers in Liber abaci were similar to those seen in the Arabic sources. The second section of Liber abaci contains a large collection of problems aimed at merchants. They are related to the price of goods, how to calculate profit on transactions, how to convert between different currencies in use in Mediterranean countries, and problems that had originated in China. A problem of the third section of Liber abaci led to the introduction of the Fibonacci numbers and the Fibonacci sequence which is now more remembered: A certain man put a pair of rabbits in a place surrounded on all sides by a fence. How many pairs of rabbits can be produced from that pair in a year if it is supposed that every month each pair begets a new pair which from the second month is productive? The resulting sequence is 1, 1, 2, 3, 5, 8 , 13, 21, 34, 55, ... (Fibonacci omitted the first term in the Liber abaci). This sequence, in which each number is the sum of the two preceding numbers, has proved extremely fruitful and appears in many different areas of mathematics and Additional science.Fibonacci's books is written geometriae Practice 1220 is dedicated to Dominicus Hispanus whom we mentioned above. It contains a large collection of geometry problems arranged into eight chapters with theorems based on the elements and Divisionesde On Euclid. Besides geometrical theorems with precise evidence, the book includes practical information for surveyors, including a chapter on how to calculate the height of tall objects using similar triangles. In Flos Fibonacci gives an accurate approximation to the solution of 10x + 2x2 + x3 = 20 , one of the problems that was

challenged to solve by Johannes of Palermo. This problem was not invented by Johannes of Palermo, but he took the book of Omar Khayyam algebra which is solved by means of the intersection of a circle and hiprbola8. Fibonacci proves that the solution of the equation is not an integer or a fraction, or the square root of a fraction. Give the approximate solution 1.3688081075, with nine decimal correct, a remarkable achievement. Quadratorum Liber, written in 1225, is the most impressive part of the work of Fibonacci, although not the work for which he is most famous. The name of the book means the book of squares and it is a book nmeros10 theory that, among other things, examines methods to find the Pythagorean triples. Fibonacci first notes that cuadrados11 numbers can be constructed as sums of odd numbers, essentially describing inductive construction. Fibonacci's influence was more limited than one would expect and apart from their role in spreading the use of HinduArabic numerals and their rabbit problem, Fibonacci's contribution to mathematics has been largely overlooked. Fibonacci's work in number theory was almost wholly ignored and virtually unknown in the Middle Ages. Three hundred years later we find the same results appearing in the work of Maurolico

Fibonacci numbers, complexity and programming.

The call sequence of Fibonacci numbers 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ... which appears first in the famous, Liber abaci (1202), published by Leonardo Pisano, as a solution to a problem breeding rabbits, satisfies the linear recurrence equation

Fn = Fn-1 + Fn-2 where F11 == F2 clearly not the only sequence of numbers, solution of the same equation in recurrence. For example, the sequence 1, 3, 4, 7, 11, 18, 29, 47, 76, ... numbers called Lucas (French mathematician, 1842-1891). Also satisfy the same recurrence equation. But the difference is in the first two terms, which in this case are F11, = F2 = 3. Since the following values of such a sequence F1,F2,F3,... are determined by the first two. There are so many successions solution as pairs of numbers F1 = a, F2 = b.

Programming recursive
If we want to program a function that calculates the nth term, Fn,of one of these solutions. The first approach is precisely recursive. For example, today, almost all high-level languages, support the following three lines that implement the calculation of Fibonacci numbers, with few differences in syntax F (1) = 1, F (2) = 1, F ( n) = F (n-1) + F (n-2) The problem is its complexity. Not only in space. Since all previous calls to the function itself, have been recalled, calculated and allocated in order to find F (n). But also the number of elementary operations. Resulting in time complexity. As you add up all the elementary operations necessary to calculate all the above. Here is a naive approach, but precise calculation of the complexity of the recursive function above. If we call S (n) the number of sums required to find F (n). For the first values is S (1) = 0 = S (2), S (3) = 1, S (4) = 2, S (5) = 4 S (6) = 7, ... and in general by induction, the number of additions to compute F (n) is equal to

S (n) = S (n-1) + S (n-2) + 1 Their growth is faster than the original function. It clearly obtained by induction that F (n-2) <S (n)

complexity.
But How fast Fibonacci function grows?. To answer that question. Calculate the roots of the characteristic equation associated with the recurrence equation F (n) = F (n-1) + F (n-2). X2 = x + 1 is, the roots of x2 - x - 1 = 0 One of them is called the golden number (Golden Ratio), whose approximate value is 1.61803 and its exact value is c = (1 + 5) / 2. clearly verified c2 = c + 1 and Thus, for any n greater than two, also cn = cn-1 + cn-2 is, the geometric progression {cn}satisfies the same equation in recurrence Fibonacci function F (n) = F ( n-1) + F (n-2). Now induction Como, c0 = 1 = F (2), c = c1 <2 = F (3). Obtain that cn-2 <F (n) In conclusion, the function of Fibonacci grows at least exponentially. Now, linking the two inequalities for all n have cn-4 <F (n-2) <S (n) and the function S (n) grows at least exponentially. Therefore recursive programming Fibonacci function has a complexity of at least exponentially. And that, regardless of how well the compiler or interpreter gestiene corresponding recursive programming. Consider then an iterative programming, however, has a much better complexity.

Programming iteratively

to calculate iteratively the Fibonacci sequence, Fn,simply assigning the next lines, that with few differences in syntax, almost every language supported high-level list (a, b) = (1,1) for (i = 2, i <= n, i + +) {(a, b) = (b, a + b)} return b; clearly only two variables are assigned in each iteration, and is also just a sum. Therefore, the total number of additions is now S (n) = n and operational complexity in this case is linear, O (n), instead of exponentially.

Improving iterative programming

Considering the matrix product is desmostrar easy induction that the powers of the matrix are doubly related to the sequence of Fibonacci numbers, equality thus applying the fast exponentiation algorithm to the matrix is possible to calculate the nth term, Fn of the Fibonacci sequence, in log2(n) iterations. A first implementation in the package Mathematica from Wolfram Research would Fibo3 [n_Integer? Positive]: = Module [{mFibo = {{1,1}, {1,0}}, MRES = {{1,0}, {0,1}}, count = n-1}, While [counter> 1 If [OddQ [counter], MRES = mRes.mFibo] counter = Floor [count / 2 ]; mFibo = mFibo.mFibo];

mFibo [[1,1]] MREs [[1,1]] + mFibo [[2,1]] MREs [[1,2]]] As in each iteration are made as maximum 2 2x2 matrix multiplications. There is a constant such that the function of operational complexity is bounded, S (n) log2(n). Obtaining a logarithmic complexity, O (log2(n)) for this version of the algorithm. Moreover, as the complexity of the multiplication is greater than the sum, the operational complexity can be measured by counting the number of elementary multiplications. How to calculate the product of two 2x2 matrices, it takes 8 multiplications of its inputs. And in each iteration can be two matrix multiplications, as much has made 16 multiplications of elements (positive integers). Where = 16.

Improving further.
Can still improve the efficiency of implementation, given that successive powers of the above matrix, or matrices all involved, symmetrical and leave all three elements suffice to determine it. Moreover, as also all the connection check invariant to11 -22 =12.Actually, only two elements are sufficient to determine the product. A programming note this would improve the halfway constant, = 8, last complexity function. Although it would still be logarithmic. For example in Mathematica. Fibo4 [n_Integer? Positive]: = Module [{m11 = 1, m12 = 1, m22 = 0, r11 = 1, r12 = 0, r22 = 1, counter = n-1}, While [counter > 1 If [OddQ [counter], {r11, r22} = {m12 * m11 * r12 + r11, r22 m22 *}; r12 = r11 - r22;] counter = Floor [counter / 2], {m11, m12 m22} = {m11 ^ 2 + ^ 2 ^ 2} m22, m12 = m11 -

m22;]; m11 m12 r11 + r12]

Comparison with Binet formula.

since 1841, we know the nth term of the Fibonacci sequence can be calculated by the formula called Binet (Binet Jacques, 1786-1856). Although in reality the first to demonstrate it was Abraham de Moivre (1667-1754).

The exact, ie without calculating any square root, only formally developed and canceling powers until a natural number, you may easily make in a language that has implentado this process. For example in Mathematica can be done with the following code: FiboBinet [n_Integer? Positive]: = (((1 + Sqrt [5]) / 2) ^ n - ((1 - Sqrt [5]) / 2) ^ n ) / Sqrt [5] / / Expand In this case, although the fast exponentiation is applied in the development of the two powers, obtaining a cost equal to the last above, we must add the cost of the function Expand (cancel to give a normal form) that make it more expensive and slower. A test, in Mathematica Timing clearly demonstrates the superiority of the previous implemantacin regarding this. If, however, a value is calculated prior to the irrational involved 5, (1 + 5) / 2, (1 - 5) / 2 with a fixed number of decimal places, binet formula has the same complexity as the best iterative algorithm, 8log2(n), but not useful for all n. And giving inaccurate results from a n, dependent on the initial accuracy, hereinafter. An implementation in Mathematica, to give correct results even n = 19999, with output more than 4,000 numbers decimal can

and conclusions.
Finally, we note that the programming or recursive implementation is far from effective. While the explicit formula is very elegant but inaccurate in practice from a n onwards. And even ineffective when compared with an iterative method specifically designed.

LEONARDO OF PISA - Fibonacci

(1180-1250)

Back to Chronological Alphabetical Nationalities

BIOGRAPHY ANECDOTES AND CURIOSITIES BOOKWRITTEN CONTRIBUTIONS TO MATHEMATICS MAJOR TRACKS BIOGRAPHY Bigollo Leonardo was born around 1179 in Pisa and date unknown death, since the only news we have are given by himself in the preface of his work, however, is believed to have died in the first half of the century XIII. Fibonacci's name, it is not known if nickname, seems to be derived from his father, (son of Bonaccio). He held a position of importance as a consular officer at the office of Bugia, Algeria, as a citizen of the city of Pisa. Leonardo comes to this city in 1192, learning here Arithmetic and Arabic in the shop of a merchant of species. It appears that for the first time made contact with Arab mathematics, and therefore the Hindu positional numbering the Arabs had generally adopted. It also met the number 0 (the Fibonacci numbers studied by far is the Greek and Roman numbering, using abacuses to calculate and therefore did not need a special symbol for zero). Received his early training Muslim teachers by Fibonacci was enthusiastic about this new type of calculation and devoted himself to instruct the business advantage. So, he was in Egypt, Syria, Greece and Sicily where he could contact Arab mathematicians of his time. He was also known in Provence and Arabic treatises on arithmetic,

possibly through the work of an Andalusian mathematician named John of Seville who had translated into Latin a work 1140 Arabian arithmetic on such calculations. Returning to Pisa in 1202 wrote his first book, the best-known, popular and more important for mathematics: Liberabaci.From this year to 1220 he wrote nothing and this year, encouraged by the philosopher of the court of Frederick II Master Domenico, composed his second book. In 1223 Pisa passed by Emperor Frederick II and before he had several discussions with other mathematical philosopher John of Palermo, which led one problem to another of his books. For all these writings are based on the works of Euclid, Heron, the Savasorda Spanish and Arabic writers, but especially of another genius hitherto unknown in the West: Diophantus.

ANECDOTES AND CURIOSITIES His name is Leonardo trodden, but sometimes he was called Bigollo which can mean "good for nothing" or " traveler. "Allhis books are manuscripts, since he lived before he invented the printing press. was more sophisticated mathematician of his time, although more involved in practical applications to abstract theorems. maintained correspondence with some people from the court Frederick II: the astrologer, Michael Scotus, the philosopher and Dominicus Theororus Hispanus. In one of his books, Flos,gives the solutions to some problems that arose Juan de Palermo was another component of the court of Frederick II . exists now a magazine dedicated to studying the famous Fibonacci series. Yourname is Fibonacci Quarterly. And a game called "The Fibonacci nim" "Fibonacci had wives who eat anything they ate, and both together weighed each one as his two predecessors was the fifth a great lady! JA Lindon

BOOKS WRITTEN in 1202 and subsequently revised in 1228 writes LiberAbaci,which is fundamentally different arithmetic problems applied to real life and commercial calculation. numbering It appears the Hindu and the famous series bearing his name., in 1228 is a revised edition dedicated to a famous astrologer wrote in1220, Geometriae Practiceis a treatise on geometry problems both on flat and solid figures. contains the beginnings of trigonometry. endorsed the work also Flos Super solutionibus quarumdam questionum geometriam ad pertinentium numerum etad.'ssay, certain solutions Bouquet issues relating to the number and geometry. Their fourth work is a simple letter that he wrote to Theodore, court philosopher Federico II, which deals with two problems, one of algebra and other geometric algebra. His last work was Liber quadratorum. This book is about square numbers. At that solves the problem raised by the mathematician John of Palermo to find a square number that increased or decreased in five units yielding another square number.

MAJOR CONTRIBUTIONS TO MATHEMATICS introduced and popularized the use of Hindu figures (current). was the introducer of the number 0. introduced the horizontal bar separating the numerator from the denominator. found a method for obtaining Pythagorean triples. proved many important results in the theory of nmermos. defined the concept of "congruum" showed that a square can not be a congruum.