This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
a=100;
b=120;
y_correct = [101 103 107 109 113];
assert(isequal(allprimes(a,b),y_correct))
|
2 | Pass |
a=140;
b=180;
y_correct = [149 151 157 163 167 173 179];
assert(isequal(allprimes(a,b),y_correct))
|
3 | Pass |
a=14;
b=20;
y_correct = [17 19];
assert(isequal(allprimes(a,b),y_correct))
|
Find the alphabetic word product
1997 Solvers
Project Euler: Problem 7, Nth prime
339 Solvers
Back to basics 9 - Indexed References
348 Solvers
Reverse the elements of an array
562 Solvers
386 Solvers