Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
p1 = 13;
p2 = 29;
ladder = prime_ladder(p1,p2);
assert(all(isprime(ladder)))
assert(iscolumn(ladder))
assert(ladder(1)==p1)
assert(ladder(end)==p2)
assert(all(sum(diff(num2str(ladder))~=0,2)==1))
|
2 | Pass |
%%
p1 = 389;
p2 = 269;
ladder = prime_ladder(p1,p2);
assert(all(isprime(ladder)))
assert(iscolumn(ladder))
assert(ladder(1)==p1)
assert(ladder(end)==p2)
assert(all(sum(diff(num2str(ladder))~=0,2)==1))
|
3 | Pass |
%%
p1 = 761;
p2 = 397;
ladder = prime_ladder(p1,p2);
assert(all(isprime(ladder)))
assert(iscolumn(ladder))
assert(ladder(1)==p1)
assert(ladder(end)==p2)
assert(all(sum(diff(num2str(ladder))~=0,2)==1))
|
4 | Pass |
%%
p1 = 983;
p2 = 239;
ladder = prime_ladder(p1,p2);
assert(all(isprime(ladder)))
assert(iscolumn(ladder))
assert(ladder(1)==p1)
assert(ladder(end)==p2)
assert(all(sum(diff(num2str(ladder))~=0,2)==1))
|
5 | Pass |
%%
p1 = 271;
p2 = 439;
ladder = prime_ladder(p1,p2);
assert(all(isprime(ladder)))
assert(iscolumn(ladder))
assert(ladder(1)==p1)
assert(ladder(end)==p2)
assert(all(sum(diff(num2str(ladder))~=0,2)==1))
|
6 | Pass |
%%
p1 = 877;
p2 = 733;
ladder = prime_ladder(p1,p2);
assert(all(isprime(ladder)))
assert(iscolumn(ladder))
assert(ladder(1)==p1)
assert(ladder(end)==p2)
assert(all(sum(diff(num2str(ladder))~=0,2)==1))
|
7 | Pass |
%%
p1 = 2267;
p2 = 1153;
ladder = prime_ladder(p1,p2);
assert(all(isprime(ladder)))
assert(iscolumn(ladder))
assert(ladder(1)==p1)
assert(ladder(end)==p2)
assert(all(sum(diff(num2str(ladder))~=0,2)==1))
|
1091 Solvers
Matrix with different incremental runs
249 Solvers
367 Solvers
158 Solvers
167 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!