Problem 1997. Compute Fibonacci Number

Solution 779634

Submitted on 16 Nov 2015

Size: 33
Leading solution size is 10.

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Solve This Problem View on Solution Map

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.

Test Suite

Test	Status	Code Input and Output
1	Fail	%% assert(isequal(fibonacci(1),1)) assert(isequal(fibonacci(2),1)) assert(isequal(fibonacci(5),5)) assert(isequal(fibonacci(7),13)) assert(isequal(fibonacci(13),233)) assert(isequal(fibonacci(15),610)) y = 2 Subscript indices must either be real positive integers or logicals.

Test

Status

Code Input and Output

Fail

%% assert(isequal(fibonacci(1),1)) assert(isequal(fibonacci(2),1)) assert(isequal(fibonacci(5),5)) assert(isequal(fibonacci(7),13)) assert(isequal(fibonacci(13),233)) assert(isequal(fibonacci(15),610))

y = 2

Subscript indices must either be real positive integers or logicals.

Problem 1997. Compute Fibonacci Number

Test Suite

Suggested Problems

More from this Author1

Problem 1997. Compute Fibonacci Number

Test Suite

Suggested Problems

More from this Author1

Players