Compute the first 10 Fibonacci numbers

Hi, I need to write a code in matlab that compute the first 10 Fibonacci numbers

But I am having some trouble with this. I thought of using the formula defined here:

https://www.math.hmc.edu/funfacts/ffiles/10002.4-5.shtml

And I've gotten this so far:

 n = 0; 
 c = (((1+sqrt(5))/2)^n -((1-sqrt(5))/2)^2)/(sqrt(5));
 while (n < 10)
    disp(c)
    n+1;
 end

But as you can probably see, it is very wrong. But I'm not sure what to do else. The professor wants us to write a proper code, meaning I can't use things like fibonacci(n). Any help would be appreciated :)

Answer 1

[Ahmos Sansom]

Hey,

I wrote a simple function attached and run with the loop listed below based on your webpage link.

Thanks

Ahmos

for i=0:10
    BinetFibonacci(i)
end

Answer 2

[James Tursa]

I'm guessing your professor expects you to implement the algorithm that he/she has given you. That is, the next number is the sum of the previous two numbers. So, here is an outline:

F = zeros(10,1);  % pre-allocate the result to hold 10 numbers
F(1) = 1;  % the first number (MATLAB indexing always starts at 1)
F(2) = 1;  % the second number
for n=3:10  % loop to find the 3rd - 10th numbers
    % You insert code here to compute F(n)
end