Problem 44384. Find the nearest prime number

Solution 1290303

Submitted on 16 Oct 2017 by @bmtran (Bryant Tran)

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test	Status	Code Input and Output
1	Pass	x = 0; y_correct = 2; assert(isequal(nearestprime(x),y_correct))
2	Pass	x = 5; y_correct = 5; assert(isequal(nearestprime(x),y_correct))
3	Pass	x = 100; y_correct = 101; assert(isequal(nearestprime(x),y_correct))
4	Pass	x = 500; y_correct = 499; assert(isequal(nearestprime(x),y_correct))
5	Pass	x = 911; y_correct = 911; assert(isequal(nearestprime(x),y_correct))
6	Pass	x = 2500; y_correct = 2503; assert(isequal(nearestprime(x),y_correct))
7	Pass	x = 8000; y_correct = 7993; assert(isequal(nearestprime(x),y_correct))
8	Pass	x = 100000; y_correct = 100003; assert(isequal(nearestprime(x),y_correct))
9	Pass	x = 1300000; y_correct = 1299989; assert(isequal(nearestprime(x),y_correct))
10	Pass	x = 179424710; y_correct = 179424719; assert(isequal(nearestprime(x),y_correct))