Cody

Problem 981. Find nearest prime number less than input number

Solution 149953

Submitted on 17 Oct 2012 by Robert
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

This solution is outdated. To rescore this solution, sign in.

Test Suite

Test Status Code Input and Output
1   Pass
%% n = 127; y_correct = 113; assert(isequal(minorprime(n),y_correct))

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

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