Cody

Problem 42340. Fibonacci Decomposition

Solution 677055

Submitted on 28 May 2015 by James
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
%% n = 1; f_correct = 1; assert(isequal(fib_decomposition(n),f_correct))

temp = 1

2   Pass
%% n = 4; f_correct = [1 3]; assert(isequal(fib_decomposition(n),f_correct))

temp = 1 1 2 3

3   Pass
%% n = 6; f_correct = [1 5]; assert(isequal(fib_decomposition(n),f_correct))

temp = 1 1 2 3 5

4   Pass
%% n = 2010; f_correct = [2 34 377 1597]; assert(isequal(fib_decomposition(n),f_correct))

temp = Columns 1 through 8 1 1 2 3 5 8 13 21 Columns 9 through 16 34 55 89 144 233 377 610 987 Column 17 1597

5   Pass
%% n = 35601; f_correct = [1 34 144 6765 28657]; assert(isequal(fib_decomposition(n),f_correct))

temp = Columns 1 through 8 1 1 2 3 5 8 13 21 Columns 9 through 16 34 55 89 144 233 377 610 987 Columns 17 through 23 1597 2584 4181 6765 10946 17711 28657

6   Pass
%% n = 9227467; f_correct = [2 9227465]; assert(isequal(fib_decomposition(n),f_correct))

temp = Columns 1 through 8 1 1 2 3 5 8 13 21 Columns 9 through 16 34 55 89 144 233 377 610 987 Columns 17 through 24 1597 2584 4181 6765 10946 17711 28657 46368 Columns 25 through 32 75025 121393 196418 317811 514229 832040 1346269 2178309 Columns 33 through 35 3524578 5702887 9227465

7   Pass
%% n = 2015; f_correct = [2 5 34 377 1597]; assert(isequal(fib_decomposition(n),f_correct))

temp = Columns 1 through 8 1 1 2 3 5 8 13 21 Columns 9 through 16 34 55 89 144 233 377 610 987 Column 17 1597