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))
S =
2
|
2 | Pass |
n = 8;
S = 714;
assert(isequal(FibSumSquares(n),S))
S =
2
|
3 | Pass |
n = 11;
S = 12816;
assert(isequal(FibSumSquares(n),S))
S =
2
|
4 | Pass |
n = 15;
S = 602070;
assert(isequal(FibSumSquares(n),S))
S =
2
|
5 | Pass |
n = 21;
S = 193864606;
assert(isequal(FibSumSquares(n),S))
S =
2
|
6 | Pass |
n = 26;
S = 23843770274;
assert(isequal(FibSumSquares(n),S))
S =
2
|
3238 Solvers
Project Euler: Problem 8, Find largest product in a large string of numbers
315 Solvers
How long is the longest prime diagonal?
338 Solvers
992 Solvers
305 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!