Concept# Fibonacci

Summary

Fibonacci (ˌfɪbəˈnɑːtʃi; also USˌfiːb-, fiboˈnattʃi; 1170 – 1240–50), also known as Leonardo Bonacci, Leonardo of Pisa, or Leonardo Bigollo Pisano ('Leonardo the Traveller from Pisa'), was an Italian mathematician from the Republic of Pisa, considered to be "the most talented Western mathematician of the Middle Ages".
The name he is commonly called, Fibonacci, was made up in 1838 by the Franco-Italian historian Guillaume Libri and is short for filius Bonacci ('son of Bonacci'). However, even earlier, in 1506, a notary of the Holy Roman Empire, Perizolo mentions Leonardo as "Lionardo Fibonacci".
Fibonacci popularized the Indo–Arabic numeral system in the Western world primarily through his composition in 1202 of Liber Abaci (Book of Calculation). He also introduced Europe to the sequence of Fibonacci numbers, which he used as an example in Liber Abaci.
Biography
Fibonacci was born around 1170 to Guglielmo, an Italian merchant and customs official.

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (1)

Loading

Related people

No results

Related units

No results

Related concepts

Loading

Related courses

Loading

Related lectures

Loading

Ali Chekir, Mohamed Slim Slama

Binomial heaps are data structures implemented as a collection of binomial trees, (A binomial tree of order K can be constructed from two trees of order (K-1)). They can implement several methods: Min, Insert, Union, ExtractMin, DecreaseKey and Delete. Fibonacci heaps are similar to binomial heaps,howevere it figured that they had a better performance in what regards the amortized analysis, These methods have a cost of O(1) except for ExtractMin and Delete (O(lg n)) Fibonacci heaps are used to improve the cost of Dijikstra and Prim. We implemented first the algorithms of Binomial and Fibonacci. We then used ExtractMin of fibonacci so as to implement Prim and Dijikstra. We have made a bonus algorithm , Kruskal who is also a "Minimum Spanning Tree" algorithm.

2006Related concepts (24)

Geometry (; ) is a branch of mathematics concerned with properties of space such as the distance, shape, size, and relative position of figures. Geometry is, along with arithmetic, one of the oldest b

In mathematics, the Fibonacci sequence is a sequence in which each number is the sum of the two preceding ones. Numbers that are part of the Fibonacci sequence are known as Fibonacci numbers, common

In mathematics, the irrational numbers (from in- prefix assimilated to ir- (negative prefix, privative) + rational) are all the real numbers that are not rational numbers. That is, irrational number

Related lectures (13)

Related courses (4)

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics as diverse as mathematical reasoning, combinatorics, discrete structures & algorithmic thinking.

CS-119(c): Information, Computation, Communication

L'objectif de ce cours est d'introduire les étudiants à la pensée algorithmique, de les familiariser avec les fondamentaux de l'Informatique et de développer une première compétence en programmation (langage C++).

CS-250: Algorithms

The students learn the theory and practice of basic concepts and techniques in algorithms. The course covers mathematical induction, techniques for analyzing algorithms, elementary data structures, major algorithmic paradigms such as dynamic programming, sorting and searching, and graph algorithms.