Fibonacci Numbers - Maple Application Center
Application Center Applications Fibonacci Numbers

Fibonacci Numbers

: Maplesoft AuthorDr. Jürgen Gerhard
Engineering software solutions from Maplesoft
This Application runs in Maple. Don't have Maple? No problem!
 Try Maple free for 15 days!
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.

Application Details

Publish Date: November 21, 2017
Created In: Maple 2017
Language: English

More Like This

Solving Cyclotomic Polynomials by Radical Expressions
The Advanced Encryption Standard and its modes of operation
Polynomial System Solving in Maple 16
Additional Functionality for PolynomialIdeals
The CayleyDickson Algebra from 4D to 256D
A new approach to Sheppard’s corrections
Groebner Bases: What are They and What are They Useful For?
Euclid's algorithm for computing greatest common divisors, with a modern improvement
Subgroup lattice plotting in 3-D