A recursive formula giving the Fibonacci number f2n
in terms of fn and fn-1 forms the basis
for efficient computation of large Fibonacci Numbers. Mathematica
can be used to derive other recursive formulas that generalize this "reduction
by halves." The additional formulas lead to algorithms that improve performance
in certain cases.