Problem 1997. Compute Fibonacci Number

Created by Alexander

Solve Later

Compute the n-th Fibonacci Number

f(0) = 0, f(1) = 1, f(2) = 1, f(3) = 2, ... f(42) = 267914296

Solve

Solution Stats

687 Solutions
321 Solvers

Last Solution submitted on Jun 01, 2020

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

Benjamin Richards on 12 Feb 2020

This is the same as Problem 12.

Solution Comments

Solution 985198

1 Comment

1 Comment

yurenchu on 24 Dec 2016

This solution returns f(0) = 1, which contradicts the decription of the given problem.

Solution 779634

3 Comments

3 Comments

Brian Butler on 16 Nov 2015

This solution uses filter from the Signal Processing Toolbox.

Peng Liu on 18 Nov 2015

Yes, it uses filter, but filter is indeed not a toolbox function, but a built-in function. You can fix the error by changing f=y(n-2) to f = y(n)

Jan Orwat on 18 Nov 2015

... and then change first input of filter to [1,-1] and remove +1 from the end of the line.

Solution 679433

2 Comments

2 Comments

Varoujan on 2 Jun 2015

Test suite is flawed. I had to add a round(x,0) function to the output to make it pass.

Jan Orwat on 3 Jun 2015

Test is correct. Fibonacci Numbers are integers, so your output should be to.

Problem Recent Solvers321

Problem Tags

fibonacci numbers

Problem 1997. Compute Fibonacci Number

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers321

Suggested Problems

More from this Author1

Problem Tags

Problem 1997. Compute Fibonacci Number

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers321

Suggested Problems

More from this Author1

Problem Tags

Players