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

About this result

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

Related people

Related units

Related concepts

Related courses

Related lectures

Summary

Official source

About this result

Related publications (1)

Related publications

Related people

Related units

Related concepts (24)

Related concepts

Related courses (4)

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.

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++).

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.

Related courses

Related lectures (13)

Related lectures

Fibonacci

Fibonacci Heaps

Fibonacci Heaps