Rate of Growth of
F
Note:
F
(
k
) >
F
(
k
-1) for all
, and
, for all
.
Theorem: For
,
.
.
F
(
k
) =
F
(
k
-1) +
F
(
k
-2) <
F
(
k
-1) +
F
(
k
-1) = 2
F
(
k
-1).
Next:
A Corollary
Up:
EUCLID'S ALGORITHM
Previous:
Classic Sequence
, and 
, for all
.
, and , for all
.
, 
.
.
