Cody

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

Solution 335335

Submitted on 17 Oct 2013 by Greg
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))

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

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

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

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

n = 2

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

n = 1

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

n = 1327

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

n = 5050108 n = 5050107 n = 5050106 n = 5050105 n = 5050104 n = 5050103 n = 5050102 n = 5050101 n = 5050100 n = 5050099