Cody

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

Solution 1873174

Submitted on 13 Jul 2019 by Nikolaos Nikolaou
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))

y = 113 y = 113

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

y = 113 y = 113

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

y = 2 y = 2

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

y = []

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

y = 1327 y = 1327

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

y = 5050099 y = 5050099

7   Pass
pn = primes(1e6); ind = max(100,floor(numel(pn)*rand)); n = pn(ind) - 1; y_correct = pn(ind - 1); assert(isequal(minorprime(n),y_correct))

y = 20483 y = 20483