Many programming language tutorials have an example about computing Fibonacci numbers to illustrate recursion. Usually, however, these simple examples exhibit an abysmal runtime behaviour, namely, exponential in the index.

In this presentation, several more efficient ways of computing Fibonacci numbers, using Maple, are discussed. The best algorithm presented is based on doubling formulae for the Fibonacci numbers, which we also prove using Maple.