以下是斐波那契数列的递归定义:
F n = F n1 + F n2, F 1 = 1,F 2 = 1.
那么其12项为:
F 1 = 1
F 2 = 1
F 3 = 2
F 4 = 3
F 5 = 5
F 6 = 8
F 7 = 13
F 8 = 21
F 9 = 34
F 10 = 55
F 11 = 89
F 12 = 144
因此第12项,F12,是第一个包含三位数字的项。
斐波那契数列中第一个包含1000位数字的项是第几项?
很简单的题目:先用2位,3位验证一下;然后perl用bignum;也就是用大数据程序如下:
use strict;
use warnings;
use bignum;
my $start_time=time;
my $first_value = 1;
my $second_value= 2;
my $third_value = 0;
my $cout = 3;
while(length($third_value)<1000)
{
$cout=$cout+1;
$third_value = $first_value+$second_value;
$first_value = $second_value;
$second_value= $third_value;
}
print "$cout\n";
my $long = time-$start_time;
print "$long\n";
结果如下:
C:\WINDOWS\system32\cmd.exe /c perl "C:\Documents and Settings\Administrator\
面\a.pl"
4782
1
Hit any key to close this window...
用时1秒。