Cody

Problem 46848. Modulo of sum of square of first n primes with 24

Solution 3355408

Submitted on 24 Oct 2020 by Rafael S.T. Vieira
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
x = 1; y_correct = 4; assert(isequal(modp24(x),y_correct))

2   Pass
x = 2; y_correct = 13; assert(isequal(modp24(x),y_correct))

3   Pass
x = 4; y_correct = 15; assert(isequal(modp24(x),y_correct))

4   Pass
x = 100; y_correct = 15; assert(isequal(modp24(x),y_correct))

5   Pass
x = 120; y_correct = 11; assert(isequal(modp24(x),y_correct))

6   Pass
x = 1000; y_correct = 3; assert(isequal(modp24(x),y_correct))

7   Pass
x = 10^9; y_correct = 3; assert(isequal(modp24(x),y_correct))

8   Pass
x = 10^12 + 15; y_correct = 18; assert(isequal(modp24(x),y_correct))

Suggested Problems

More from this Author5

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!