1-2 數學歸法
例28
The Fibonacci numbers F, have the initial values Fo= 0, F1 = 1, and the recursion F,
F-1 + Fn-2 if n 2. Prove by induction that
72
1-5
F. =
1 ((1+v5
)
5
ifn>0.
(92.93 暨大資
12
2
2
假設v=
a=1+05.18-1-5
首先觀察 e' =
3+、5
= a +11
2
2
2
( (1-√5
1
3-75
R2
如珍E
1 1
fo"
R")gn>0
