0x0012 - Fibonacci sequence – Part 2

Tue, 03 Jan 2012 18:50:27 +0000

In this post we’ll compare the various methods of generating Fibonacci sequence terms and implementing the code to recognize Fibonacci terms and to determine index of these terms. These have been discussed mathematically in the previous post.

Generating Fibonacci Terms

Method 1 – Iterative method

Using the basic concept of the Fibonacci sequence, that each term is the sum of the previous two terms, the following function in Python generates the nth term:

0x0011 - Fibonacci sequence

Mon, 21 Nov 2011 19:06:33 +0000

The Fibonacci sequence in mathematics is the following sequence of numbers:

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233 …

Representation

By definition, the first two terms are 0 and 1, and each of the terms following them are the sum of two previous terms. So, if we say Fn is the nth term in the Fibonacci sequence, then we can express the sequence recursively as:

Mathematics on Rohit Jha

0x0012 - Fibonacci sequence – Part 2

Generating Fibonacci Terms

0x0011 - Fibonacci sequence

Representation