推式:
f(0)=1,f(1)=1;f(n)=f(n−1)+f(n−2)(n>=2)
f
(
0
)
=
1
,
f
(
1
)
=
1
;
f
(
n
)
=
f
(
n
−
1
)
+
f
(
n
−
2
)
(
n
>=
2
)
通项公式:
f(n)=15√[1+5√2n−1−5√2n]
f
(
n
)
=
1
5
[
1
+
5
2
n
−
1
−
5
2
n
]
性质:
- gcd(f(i),f(j))=f(gcd(i,j)) g c d ( f ( i ) , f ( j ) ) = f ( g c d ( i , j ) )
- 若 n|m n | m ,则 f(n)|f(m) f ( n ) | f ( m )
- 若 f(n)|x f ( n ) | x ,则 f(n∗i)|x f ( n ∗ i ) | x
- ∑ni=1f(i)=f(n+2)−1 ∑ i = 1 n f ( i ) = f ( n + 2 ) − 1
推论:
- 在模的情况下,斐波那契数列会出现循环,可以打表找出
- 奇数项求和: f[1]+f[3]+...+f[2n−1]=f[2n]−f[2]+f[1] f [ 1 ] + f [ 3 ] + . . . + f [ 2 n − 1 ] = f [ 2 n ] − f [ 2 ] + f [ 1 ] ,偶数项求和: f[2]+f[4]+...+f[2n]=f[2n+1]−f[1] f [ 2 ] + f [ 4 ] + . . . + f [ 2 n ] = f [ 2 n + 1 ] − f [ 1 ] ,平方项求和: f[1]2+f[2]2+.....f[n]2=f[n]∗f[n+1] f [ 1 ] 2 + f [ 2 ] 2 + . . . . . f [ n ] 2 = f [ n ] ∗ f [ n + 1 ] 。