Cody

# Problem 44384. Find the nearest prime number

Solution 1303725

Submitted on 20 Oct 2017 by Eric G.
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))

a = 0 b = 0 ans = 2

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

a = 5 b = 5 ans = 5

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

a = 100 b = 100 ans = 101

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

a = 500 b = 500 ans = 499

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

a = 911 b = 911 ans = 911

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

a = 2500 b = 2500 ans = 2503

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

a = 8000 b = 8000 ans = 7993

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

a = 100000 b = 100000 ans = 100003

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

a = 1300000 b = 1300000 ans = 1299989

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

a = 179424710 b = 179424710 ans = 179424719