Cody

# Problem 44384. Find the nearest prime number

Solution 1389307

Submitted on 21 Dec 2017 by Mahadev Krishnan
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))

s = 2 ans = 0 ans = 2

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

s = 5 d = 5 ans = 5

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

s = 101 d = 97 ans = 101

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

s = 503 d = 499 ans = 499

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

s = 911 d = 911 ans = 911

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

s = 2503 d = 2477 ans = 2503

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

s = 8009 d = 7993 ans = 7993

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

s = 100003 d = 99991 ans = 100003

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

s = 1300021 d = 1299989 ans = 1299989

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

s = 179424719 d = 179424697 ans = 179424719