Cody

Problem 42935. Sums of cubes and squares of sums

Solution 2688299

Submitted on 13 Jul 2020 by Benedict Goodman
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; y_correct = 2; assert(isequal(cubesLessSquare(n),y_correct))

2   Pass
n = 2; y_correct = 9; assert(isequal(cubesLessSquare(n),y_correct))

3   Pass
n = 3; y_correct = 24; assert(isequal(cubesLessSquare(n),y_correct))

4   Pass
n = 5; y_correct = 90; assert(isequal(cubesLessSquare(n),y_correct))

5   Pass
n = 10; y_correct = 605; assert(isequal(cubesLessSquare(n),y_correct))

6   Pass
n = 123; y_correct = 945624; assert(isequal(cubesLessSquare(n),y_correct))

7   Pass
n = 31; y_correct = 15872; assert(isequal(cubesLessSquare(n),y_correct))

8   Pass
n = 314; y_correct = 15578325; assert(isequal(cubesLessSquare(n),y_correct))

9   Pass
n = 3141; y_correct = 15504233562; assert(isequal(cubesLessSquare(n),y_correct))

10   Pass
n = 31415; y_correct = 15502753617120; assert(isequal(cubesLessSquare(n),y_correct))

11   Pass
n = 314159; y_correct = uint64(15503197751395200); assert(isequal(cubesLessSquare(n),y_correct))

12   Pass
n = 1e5; y_correct = uint64(500010000050000); assert(isequal(cubesLessSquare(n),y_correct))

13   Pass
n = 123456; y_correct = uint64(940835389047072); assert(isequal(cubesLessSquare(n),y_correct))