Cody

# Problem 981. Find nearest prime number less than input number

Solution 1235696

Submitted on 20 Jul 2017 by Augusto Mazzei
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
n = 127; y_correct = 113; assert(isequal(minorprime(n),y_correct))

ans = 125 ans = 124 ans = 123 ans = 122 ans = 121 ans = 120 ans = 119 ans = 118 ans = 117 ans = 116 ans = 115 ans = 114 ans = 113

2   Pass
n = 125; y_correct = 113; assert(isequal(minorprime(n),y_correct))

ans = 123 ans = 122 ans = 121 ans = 120 ans = 119 ans = 118 ans = 117 ans = 116 ans = 115 ans = 114 ans = 113

3   Pass
n = 3; y_correct = 2; assert(isequal(minorprime(n),y_correct))

4   Pass
n = 2; y_correct = 1; assert(isequal(minorprime(n),y_correct))

5   Pass
n = 1328; y_correct = 1327; assert(isequal(minorprime(n),y_correct))

6   Pass
n = 5050109; y_correct = 5050099; assert(isequal(minorprime(n),y_correct))

ans = 5050107 ans = 5050106 ans = 5050105 ans = 5050104 ans = 5050103 ans = 5050102 ans = 5050101 ans = 5050100 ans = 5050099