Posted by **Nelly** on Thursday, February 24, 2011 at 7:06am.

How to write an algorithm to find the fibonacci series ???

Help:/

- Computer -
**MathMate**, Thursday, February 24, 2011 at 8:48am
The fibonacci series is defined as the set of terms a(n)∈Z+ (i.e. all terms are integers) such that:

a(0)=0

a(1)=1

a(i)=a(i-2)+a(i-1), i≥2

The pseudocode resembles a lot the definition of the series:

Input: n

a(0)=0

a(1)=1

for i=2,i<=n,i++: a(i)=a(i-2)+a(i-1) next

return a(n)

Note that a closed form formula for evaluating a(n) exists, and is called the Binet's formula:

a(n)=((p^n-(-1/p)^n)/sqrt(5)

where p=(1+sqrt(5))/2 = the golden ratio

However, since the result has to be an integer, and the calculations required are real, there could be rounding problems with calculations performed on a digital computer, unless symbolic algebra is available.

## Answer This Question

## Related Questions

- computer - Write an algorithm for a program that accepts a set of numbers and ...
- Pre-Calc - Find three examples of the Fibonacci sequence in nature. Write a ...
- computer - draw a flowchart and write the algorithm for printing the first 10 ...
- computer - write an algorithm , draw a flowchart and write a program to ...
- computer science - draw a flowchart and write the algorithm for printing the ...
- Math (fibonacci - A sequence of numbers is called a Fibonacci-type sequence if ...
- physics - n this problem, we will carry out some steps of the quantum factoring ...
- Computer - Write an algorithm and flowchart that will accept 30 students ...
- Quantum Physics - In this problem, we will carry out some steps of the quantum ...
- Computer science - Score 1,Score 2 and Score 3 are the marks scored by a student...

More Related Questions