Cody

Problem 1394. Prime Ladders

Solution 2448535

Submitted on 1 Jun 2020 by Jan Olsen
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
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))

ladder = 13 19 29

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

ladder = 389 383 283 263 269

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

ladder = 761 461 467 367 397

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

ladder = 983 283 233 239

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

ladder = 271 211 311 331 431 439

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

ladder = 877 677 673 773 733

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

ladder = 2267 2207 2203 2003 2053 2153 1153