Where f () represents the value of the nth item, F(n- 1) represents the value of the nth item, and F(-2) represents the value of the nth item. This recursive formula is very simple, but it can generate an infinite number of Fibonacci sequences.
Fibonacci series, also known as the golden section series, was introduced by the mathematics ∈N* Leonardo Fibonacci, taking raising rabbits as an example, so it is also called "rabbit series". Its numerical values are: 1, 1, 2,3,5,8,13,21,34. ...
1202, Fibonacci put forward Fibonacci sequence in the book of calculation (LiberAbaci). Fibonacci snails can be folded in this order; Draw Fibonacci spiral, etc. In addition, this series has direct applications in modern physics, quasicrystal structure, chemistry and other fields. Therefore, since 1963, the American Mathematical Society has published a mathematical magazine named Fibonacci Series Quarterly, which specially publishes related research results.
Fibonacci series is defined by Italian mathematician Leonardo Fibonacci, who was born in 1 170 and died in 1250. His birthplace is Pisa. He is called "Leonardo of Pisa". 1202, he wrote the book Lieberbatch. He was the first European to study the mathematical theories of India and Arabia.
His father was hired as a diplomatic consul by a business group in Pisa and stationed in Algeria, so Leonardo was able to study mathematics under the guidance of an Arab teacher. He also studied mathematics in Egypt, Syria, Greece, Sicily and Provence. In addition, Fibonacci sequence is also widely used in computer C language programming problems.