Cody

# Problem 44384. Find the nearest prime number

Solution 1289605

Submitted on 16 Oct 2017 by Reggie Wilcox
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))

y = 0 i = 0 i = 1 i = 2 y = 2 i = 3

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

y = 0 i = 0 y = 5 i = 1

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

y = 0 i = 0 i = 1 y = 101 i = 2

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

y = 0 i = 0 i = 1 y = 499 i = 2

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

y = 0 i = 0 y = 911 i = 1

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

y = 0 i = 0 i = 1 i = 2 i = 3 y = 2503 i = 4

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

y = 0 i = 0 i = 1 i = 2 i = 3 i = 4 i = 5 i = 6 i = 7 y = 7993 i = 8

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

y = 0 i = 0 i = 1 i = 2 i = 3 y = 100003 i = 4

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

y = 0 i = 0 i = 1 i = 2 i = 3 i = 4 i = 5 i = 6 i = 7 i = 8 i = 9 i = 10 i = 11 y = 1299989 i = 12

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

y = 0 i = 0 i = 1 i = 2 i = 3 i = 4 i = 5 i = 6 i = 7 i = 8 i = 9 y = 179424719 i = 10