Cody

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

Solution 2794567

Submitted on 6 Aug 2020
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   Fail
n = 127; y_correct = 113; assert(isequal(minorprime(n),y_correct))

Error in solution: Line: 6 Column: 13 Invalid expression. Check for missing or extra characters.

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

Error in solution: Line: 6 Column: 13 Invalid expression. Check for missing or extra characters.

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

Error in solution: Line: 6 Column: 13 Invalid expression. Check for missing or extra characters.

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

Error in solution: Line: 6 Column: 13 Invalid expression. Check for missing or extra characters.

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

Error in solution: Line: 6 Column: 13 Invalid expression. Check for missing or extra characters.

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

Error in solution: Line: 6 Column: 13 Invalid expression. Check for missing or extra characters.

7   Fail
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))

Error in solution: Line: 6 Column: 13 Invalid expression. Check for missing or extra characters.