Delphi裴波纳契数列求和实例,请输入要计算数字的前多少位。斐波那契数列，又称黄金分割数列，指的是这样一个数列：0、1、1、2、3、5、8、13、21、……在数学上，斐波纳契数列以如下被以递归的方法定义：F0=0，F1=1，Fn=F(n-1)+F(n-2)（n>=2，n∈N*）在现代物理、准晶体结构、化学等领域，斐波纳契数列都有直接的应用。本例用Delphi来演示斐波那契数列的简单应用。-Delphi Fibonacci numbers and examples, please input the figures before the number of bits. The Fibonacci sequence, also called the Fibonacci sequence, which is a series: 0, 1, 1, 2, 3, 5, 8, 13, 21,...... In mathematics, the Fibonacci sequence in the following is based on the definition of recursive method: F0=0, F1=1, Fn=F (n-1)+F (n-2) (n>=2, n ∈ N*) in modern physics, crystal structure, chemical field, the Fibonacci sequence has direct application. The cases used Delphi to demonstrate the simple application of the Fibonacci sequence. And the number of array elements, and then click the "block" button, you can see the grouping effect.