This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 5;
S = 40;
assert(isequal(FibSumSquares(n),S))
|
2 | Pass |
n = 8;
S = 714;
assert(isequal(FibSumSquares(n),S))
|
3 | Pass |
n = 11;
S = 12816;
assert(isequal(FibSumSquares(n),S))
|
4 | Pass |
n = 15;
S = 602070;
assert(isequal(FibSumSquares(n),S))
|
5 | Pass |
n = 21;
S = 193864606;
assert(isequal(FibSumSquares(n),S))
|
6 | Pass |
n = 26;
S = 23843770274;
assert(isequal(FibSumSquares(n),S))
|
616 Solvers
The Hitchhiker's Guide to MATLAB
2696 Solvers
151 Solvers
How long is the longest prime diagonal?
280 Solvers
Integer Sequence - II : New Fibonacci
141 Solvers