Cody

Solution 2104845

Submitted on 24 Jan 2020 by Sophia Nguyen
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))

2   Pass
n = 7; out = 11; assert(isequal(nextprimenum(n),out))

j = 2 j = 3 j = 4

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

j = 2 j = 2 j = 2 j = 3 j = 4 j = 2 j = 3 j = 2

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

j = 2 j = 2 j = 3 j = 4 j = 2 j = 3 j = 4 j = 2 j = 3 j = 4 j = 5 j = 6 j = 2 j = 2 j = 3 j = 4 j = 5 j = 6 j = 2

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

j = 2 j = 2 j = 2 j = 3 j = 4 j = 5 j = 2 j = 3 j = 4 j = 2 j = 2 j = 3 j = 4 j = 2 j = 2 j = 3 j = 2

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

j = 2 j = 3 j = 4 j = 5 j = 6 j = 7 j = 8 j = 9 j = 10 j = 11 j = 12 j = 2 j = 3 j = 4 j = 5 j = 6 j = 7 j = 2 j = 3 j = 4 j = 5 j = 6 j = 7 j = 8 j = 9 j = 10 j = 11 j = 2 j = 2 j = 3 j = 4 j = 5 j = 6 j = 7 j = 8 j = 9 j = 10 j = 11 j = 12 j = 13 j = 14 j = 15 j = 16 j = 2 j = 3 j = 4 j = 5 j = 6 j = 7 j = 8 j = 9 j = 10 j = 11 j = 12 j = 13 j = 14 j = 15 j = 16 j = 17 j = 18 j = 2 j = 2 j = 3 j = 4 j = 5 j = 6 j = 7 j = 8 j = 9 j = 2 j = 3 j = 4 j = 5 j = 6 j = 7 j = 8 j = 9 j = 10 j = 11 j = 12 j = 13 j = 14