Cody

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

Solution 1832747

Submitted on 31 May 2019 by William
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
n=4; p=3; [a,b]=APk_min_end(p,n); toc assert(isequal(a+b*prod(primes(p))*n,29))

Elapsed time is 0.049220 seconds.

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

Elapsed time is 0.072074 seconds.

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

Elapsed time is 0.091651 seconds.

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

Elapsed time is 0.118046 seconds.

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

Elapsed time is 0.143853 seconds.

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

Elapsed time is 0.169294 seconds.

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

Elapsed time is 2.461556 seconds.

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

Elapsed time is 4.788478 seconds.

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

Elapsed time is 5.699016 seconds.