Current location - Training Enrollment Network - Mathematics courses - General term formula of Fibonacci sequence
General term formula of Fibonacci sequence
The general formula of Fibonacci sequence: f [n] = f [n-1]+f [n-2] (n&; gt; =2,F[0]= 1,F[ 1]= 1)。

Fibonacci series is introduced as follows:

Fibonacci series, also known as the golden section series, was introduced by mathematician Leonardo Fibonacci by taking raising rabbits as an example, so it is also called "rabbit series".

Its numerical values are: 1, 1, 2, 3, 5, 8, 13, 2 1, 34 ... Mathematically, this series is defined by the following recursive method: F(0)= 1.

1202, Fibonacci proposed Fibonacci sequence in Liber Abaci. 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 sequence is defined by Italian mathematician Leonardo Fibonacci (Leonardo? Fibonacci), born in 1 170, died in 1250, and was born in Pisa. He is called "Leonardo of Pisa". 1202, he wrote the book Liber Abacci.

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.

Leonardo was therefore 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.