Cody

Solution 284458

Submitted on 18 Jul 2013 by Suman Saha
  • Size: 11
  • This is the leading solution.
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 = 1; out = 2; assert(isequal(nextprimenum(n),out))
ans = []
2   Pass
%% n = 7; out = 11; assert(isequal(nextprimenum(n),out))
ans = []
3   Pass
%% n = [1 2 3 4 5 6 7 8 9]; out = [2 3 5 5 7 7 11 11 11]; assert(isequal(nextprimenum(n),out))
ans = []
4   Pass
%% n = [71 25 63 47 65 36 47 58 69]; out = [73 29 67 53 67 37 53 59 71]; assert(isequal(nextprimenum(n),out))
ans = []
5   Pass
%% n = [171 255 636 487 675 369 477 538 969]; out = [173 257 641 491 677 373 479 541 971]; assert(isequal(nextprimenum(n),out))
ans = []
6   Pass
%% n = [172541 255564 632436 4564587 6778675 334469 475647 575638 96879]; out = [172553 255571 632447 4564589 6778691 334487 475649 575647 96893]; assert(isequal(nextprimenum(n),out))
ans = []