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))
|
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))
|
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))
|
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))
|
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))
|
17120 Solvers
584 Solvers
Determine Whether an array is empty
646 Solvers
669 Solvers
Find the next Fibonacci number
223 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!