The Fibonacci sequence is one of the most famous formulas in mathematics. Each number in the sequence is the sum of the two numbers that precede it. So, the sequence goes: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, and so on.
It’s true that the Fibonacci sequence is tightly connected to what’s now known as the golden ratio, but it’s topic for another exercise.
In computer programming, Fibonacci numbers give a model for designing recursive programming algorithms. An example recursive fibonacci sequence function shown below using Python.
fibonacci(n):
if(n <= 1):
return n
else:
return(fibonacci(n-1) + fibonacci(n-2))
For more information check out this website and wikipedia page.
Because implementing fibonacci was so simple for us, lets thinks backwards. Here is a MATLAB function which returns the index of the input number in fibonacci sequence. If input value is not a member of fibonacci sequence it gives -1. For instance if we give 89 as an input, it should return 10 and if we pass 92, it should return -1.
function output = fibonacci_finder(input)
% Fibonacci Finder: Program that determines a number if its Fibonacci is given.
a = 0;
b = 1;
temp = 0;
count = 0;
while(true)
temp = a;
a = b;
b = temp + b;
if(a == input)
break;
end
else if(a > input) % If input number didn't within the sequence
count = -1; % Return -1
break;
end
count = count + 1;
end
output = count; % Index in sequence
end