Cody

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

Solution 325921

Submitted on 30 Sep 2013 by Alfonso Nieto-Castanon
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
tic n=3; p=3; [a,b]=APk_min_end(p,n); toc assert(isequal(a+b*prod(primes(p))*n,23))

Elapsed time is 2.343861 seconds.

2   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 4.646183 seconds.

3   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 7.051103 seconds.

4   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 9.424893 seconds.

5   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 11.956967 seconds.

6   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 14.462294 seconds.

7   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 16.942363 seconds.

8   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 19.508289 seconds.

9   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 22.103434 seconds.

10   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 24.766324 seconds.

### Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!