Cody

Problem 1688. Prime Sequences: AP-k Minimum Final Value

Solution 1278988

Submitted on 30 Sep 2017
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   Fail
n=4; p=3; [a,b]=APk_min_end(p,n); toc assert(isequal(a+b*prod(primes(p))*n,29))

kprim = 6 ans = 5 1 2 3 7 8 23 41 59 131 149 Elapsed time is 0.016660 seconds.

Assertion failed.

2   Fail
n=5; p=5; [a,b]=APk_min_end(p,n); toc assert(isequal(a+b*prod(primes(p))*n,157))

kprim = 6 ans = 5 1 2 3 7 8 23 41 59 131 149 Elapsed time is 0.016660 seconds.

Assertion failed.

3   Fail
n=6; k=5; [a,b]=APk_min_end(k,n); toc assert(isequal(a+b*prod(primes(k))*n,907))

kprim = 6 ans = 5 1 2 3 7 8 23 41 59 131 149 Elapsed time is 0.016660 seconds.

Assertion failed.

4   Fail
n=7; k=7; [a,b]=APk_min_end(k,n); toc assert(isequal(a+b*prod(primes(k))*n,1669))

kprim = 6 ans = 5 1 2 3 7 8 23 41 59 131 149 Elapsed time is 0.016660 seconds.

Assertion failed.

5   Fail
n=8; k=7; [a,b]=APk_min_end(k,n); toc assert(isequal(a+b*prod(primes(k))*n,1879))

kprim = 6 ans = 5 1 2 3 7 8 23 41 59 131 149 Elapsed time is 0.016660 seconds.

Assertion failed.

6   Fail
n=9; k=7; [a,b]=APk_min_end(k,n); toc assert(isequal(a+b*prod(primes(k))*n,2089))

kprim = 6 ans = 5 1 2 3 7 8 23 41 59 131 149 Elapsed time is 0.016660 seconds.

Assertion failed.

7   Fail
n=10; k=11; [a,b]=APk_min_end(k,n); toc assert(isequal(a+b*prod(primes(k))*n,249037))

kprim = 6 ans = 5 1 2 3 7 8 23 41 59 131 149 Elapsed time is 0.016660 seconds.

Assertion failed.

8   Fail
n=11; k=11; [a,b]=APk_min_end(k,n); toc assert(isequal(a+b*prod(primes(k))*n,262897))

kprim = 6 ans = 5 1 2 3 7 8 23 41 59 131 149 Elapsed time is 0.016660 seconds.

Assertion failed.

9   Fail
n=12; k=13; [a,b]=APk_min_end(k,n); toc assert(isequal(a+b*prod(primes(k))*n,725663))

kprim = 6 ans = 5 1 2 3 7 8 23 41 59 131 149 Elapsed time is 0.016660 seconds.

Assertion failed.