Cody

Problem 1946. Fibonacci-Sum of Squares

Solution 2180028

Submitted on 28 Mar 2020 by Ahmed Abdelbasit
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

Test Suite

Test Status Code Input and Output
1   Pass
n = 5; S = 40; assert(isequal(FibSumSquares(n),S))

x = 1 1 2 x = 1 1 2 3 x = 1 1 2 3 5 S = 40
2   Pass
n = 8; S = 714; assert(isequal(FibSumSquares(n),S))

x = 1 1 2 x = 1 1 2 3 x = 1 1 2 3 5 x = 1 1 2 3 5 8 x = 1 1 2 3 5 8 13 x = 1 1 2 3 5 8 13 21 S = 714
3   Pass
n = 11; S = 12816; assert(isequal(FibSumSquares(n),S))

x = 1 1 2 x = 1 1 2 3 x = 1 1 2 3 5 x = 1 1 2 3 5 8 x = 1 1 2 3 5 8 13 x = 1 1 2 3 5 8 13 21 x = 1 1 2 3 5 8 13 21 34 x = 1 1 2 3 5 8 13 21 34 55 x = 1 1 2 3 5 8 13 21 34 55 89 S = 12816
4   Pass
n = 15; S = 602070; assert(isequal(FibSumSquares(n),S))

x = 1 1 2 x = 1 1 2 3 x = 1 1 2 3 5 x = 1 1 2 3 5 8 x = 1 1 2 3 5 8 13 x = 1 1 2 3 5 8 13 21 x = 1 1 2 3 5 8 13 21 34 x = 1 1 2 3 5 8 13 21 34 55 x = 1 1 2 3 5 8 13 21 34 55 89 x = 1 1 2 3 5 8 13 21 34 55 89 144 x = 1 1 2 3 5 8 13 21 34 55 89 144 233 x = 1 1 2 3 5 8 13 21 34 55 89 144 233 377 x = 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 S = 602070
5   Pass
n = 21; S = 193864606; assert(isequal(FibSumSquares(n),S))

x = 1 1 2 x = 1 1 2 3 x = 1 1 2 3 5 x = 1 1 2 3 5 8 x = 1 1 2 3 5 8 13 x = 1 1 2 3 5 8 13 21 x = 1 1 2 3 5 8 13 21 34 x = 1 1 2 3 5 8 13 21 34 55 x = 1 1 2 3 5 8 13 21 34 55 89 x = 1 1 2 3 5 8 13 21 34 55 89 144 x = 1 1 2 3 5 8 13 21 34 55 89 144 233 x = 1 1 2 3 5 8 13 21 34 55 89 144 233 377 x = 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 x = 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 x = Columns 1 through 14 1 1 2 3 5 8 13 21 34 55 89 144 233 377 Columns 15 through 17 610 987 1597 x = Columns 1 through 14 1 1 2 3 5 8 13 21 34 55 89 144 233 377 Columns 15 through 18 610 987 1597 2584 x = Columns 1 through 14 1 1 2 3 5 8 13 21 34 55 89 144 233 377 Columns 15 through 19 610 987 1597 2584 4181 x = Columns 1 through 14 1 1 2 3 5 8 13 21 34 55 89 144 233 377 Columns 15 through 20 610 987 1597 2584 4181 6765 x = Columns 1 through 14 1 1 2 3 5 8 13 21 34 55 89 144 233 377 Columns 15 through 21 610 987 1597 2584 4181 6765 10946 S = 193864606
6   Pass
n = 26; S = 23843770274; assert(isequal(FibSumSquares(n),S))

x = 1 1 2 x = 1 1 2 3 x = 1 1 2 3 5 x = 1 1 2 3 5 8 x = 1 1 2 3 5 8 13 x = 1 1 2 3 5 8 13 21 x = 1 1 2 3 5 8 13 21 34 x = 1 1 2 3 5 8 13 21 34 55 x = 1 1 2 3 5 8 13 21 34 55 89 x = 1 1 2 3 5 8 13 21 34 55 89 144 x = 1 1 2 3 5 8 13 21 34 55 89 144 233 x = 1 1 2 3 5 8 13 21 34 55 89 144 233 377 x = 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 x = 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 x = Columns 1 through 14 1 1 2 3 5 8 13 21 34 55 89 144 233 377 Columns 15 through 17 610 987 1597 x = Columns 1 through 14 1 1 2 3 5 8 13 21 34 55 89 144 233 377 Columns 15 through 18 610 987 1597 2584 x = Columns 1 through 14 1 1 2 3 5 8 13 21 34 55 89 144 233 377 Columns 15 through 19 610 987 1597 2584 4181 x = Columns 1 through 14 1 1 2 3 5 8 13 21 34 55 89 144 233 377 Columns 15 through 20 610 987 1597 2584 4181 6765 x = Columns 1 through 14 1 1 2 3 5 8 13 21 34 55 89 144 233 377 Columns 15 through 21 610 987 1597 2584 4181 6765 10946 x = Columns 1 through 14 1 1 2 3 5 8 13 21 34 55 89 144 233 377 Columns 15 through 22 610 987 1597 2584 4181 6765 10946 17711 x = Columns 1 through 14 1 1 2 3 5 8 13 21 34 55 89 144 233 377 Columns 15 through 23 610 987 1597 2584 4181 6765 10946 17711 28657 x = Columns 1 through 14 1 1 2 3 5 8 13 21 34 55 89 144 233 377 Columns 15 through 24 610 987 1597 2584 4181 6765 10946 17711 28657 46368 x = Columns 1 through 14 1 1 2 3 5 8 13 21 34 55 89 144 233 377 Columns 15 through 25 610 987 1597 2584 4181 6765 10946 17711 28657 46368 75025 x = Columns 1 through 14 1 1 2 3 5 8 13 21 34 55 89 144 233 377 Columns 15 through 26 610 987 1597 2584 4181 6765 10946 17711 28657 46368 75025 121393 S = 2.3844e+10

Suggested Problems