Cody

Problem 44384. Find the nearest prime number

Solution 3472203

Submitted on 29 Oct 2020
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   Fail
x = 0; y_correct = 2; assert(isequal(nearestprime(x),y_correct))

Array indices must be positive integers or logical values. Error in nearestprime (line 5) x1= primes(x);x1=x1(end); Error in Test1 (line 3) 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))

Suggested Problems

More from this Author44

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!