Problem 12. Fibonacci sequence

very basic problem

basic... but where is the description of the Fibonacci series?

lim_n->(inf) of fib(n+1)/fib(n)=golden ratio :0

((((((1+sqrt(5)))^n)-(((1-sqrt(5)))^n)))/2*n*sqrt(5))

Only size matters?
I have tested tic toc time for 4 kinds of solutions I have seen for this problem. I have computed 1e5 fibonacci numbers f(n) with n<=70 picked at random. Here are the results:
1) Explicit formula (sltn 408159, size 42): 3.83e-01 s. \\
2) for loop (sltn 409425, size 36): 1.09e-01 s. \\
3) filter (sltn 409380, size 33): 4.78e-01 s. \\
4) Recursion (sltn 408916, size 31): inifinity

fibonacci, a math out of gods creation

I remember we did this in highschool ))

Really the most awful problem. Add f=whateverucalledthevector(n) at the end to make the script work.

Good Problem.

easy

Interesting one!

give me a new think about numbers

I am unsure why this code is not working.

function f = fib(n)
f(1)=1;
f(2)=1;
for i=3:n
f(i)=f(i-1)+f(i-2);
end
age=f(n);
X=['f is ',num2str(age)];
disp(X)

end

this is cool xd