Cody

Problem 44384. Find the nearest prime number

Solution 1708611

Submitted on 18 Jan 2019 by Tan Yi Jin
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 = 0; y_correct = 2; assert(isequal(nearestprime(x),y_correct))

[Warning: Too many FOR loop iterations. Stopping after 9223372036854775806 iterations.] [> In nearestprime (line 7) In ScoringEngineTestPoint1 (line 3) In solutionTest (line 3)] y = 2

2   Pass
x = 5; y_correct = 5; assert(isequal(nearestprime(x),y_correct))

[Warning: Too many FOR loop iterations. Stopping after 9223372036854775806 iterations.] [> In nearestprime (line 7) In ScoringEngineTestPoint2 (line 3) In solutionTest (line 5)] y = 5

3   Pass
x = 100; y_correct = 101; assert(isequal(nearestprime(x),y_correct))

[Warning: Too many FOR loop iterations. Stopping after 9223372036854775806 iterations.] [> In nearestprime (line 7) In ScoringEngineTestPoint3 (line 3) In solutionTest (line 7)] y = 101

4   Pass
x = 500; y_correct = 499; assert(isequal(nearestprime(x),y_correct))

[Warning: Too many FOR loop iterations. Stopping after 9223372036854775806 iterations.] [> In nearestprime (line 7) In ScoringEngineTestPoint4 (line 3) In solutionTest (line 9)] y = 499

5   Pass
x = 911; y_correct = 911; assert(isequal(nearestprime(x),y_correct))

[Warning: Too many FOR loop iterations. Stopping after 9223372036854775806 iterations.] [> In nearestprime (line 7) In ScoringEngineTestPoint5 (line 3) In solutionTest (line 11)] y = 911

6   Pass
x = 2500; y_correct = 2503; assert(isequal(nearestprime(x),y_correct))

[Warning: Too many FOR loop iterations. Stopping after 9223372036854775806 iterations.] [> In nearestprime (line 7) In ScoringEngineTestPoint6 (line 3) In solutionTest (line 13)] y = 2503

7   Pass
x = 8000; y_correct = 7993; assert(isequal(nearestprime(x),y_correct))

[Warning: Too many FOR loop iterations. Stopping after 9223372036854775806 iterations.] [> In nearestprime (line 7) In ScoringEngineTestPoint7 (line 3) In solutionTest (line 15)] y = 7993

8   Pass
x = 100000; y_correct = 100003; assert(isequal(nearestprime(x),y_correct))

[Warning: Too many FOR loop iterations. Stopping after 9223372036854775806 iterations.] [> In nearestprime (line 7) In ScoringEngineTestPoint8 (line 3) In solutionTest (line 17)] y = 100003

9   Pass
x = 1300000; y_correct = 1299989; assert(isequal(nearestprime(x),y_correct))

[Warning: Too many FOR loop iterations. Stopping after 9223372036854775806 iterations.] [> In nearestprime (line 7) In ScoringEngineTestPoint9 (line 3) In solutionTest (line 19)] y = 1299989

10   Pass
x = 179424710; y_correct = 179424719; assert(isequal(nearestprime(x),y_correct))

[Warning: Too many FOR loop iterations. Stopping after 9223372036854775806 iterations.] [> In nearestprime (line 7) In ScoringEngineTestPoint10 (line 3) In solutionTest (line 21)] y = 179424719