Cody

# Problem 44384. Find the nearest prime number

Solution 1878986

Submitted on 19 Jul 2019
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   Fail
x = 0; y_correct = 2; assert(isequal(nearestprime(x),y_correct))

Error using isprime (line 19) All entries of X must be nonnegative integers. Error in nearestprime (line 10) while isprime(z)==0 Error in Test1 (line 3) assert(isequal(nearestprime(x),y_correct))

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

5

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

101

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

499

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

911

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

2503

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

7993

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

100003

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

1299989

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

179424719