Cody

Problem 42749. Find the nearest prime

Solution 1578567

Submitted on 9 Jul 2018
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
n = 3; y_correct = 3; assert(isequal(closestPrime(n),y_correct))
2   Fail
n = 20; y_correct = 23; assert(isequal(closestPrime(n),y_correct))

Assertion failed.
3   Fail
n = 86; y_correct = 89; assert(isequal(closestPrime(n),y_correct))

Assertion failed.
4   Pass
n = 250; y_correct = 251; assert(isequal(closestPrime(n),y_correct))

Suggested Problems