Cody

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

Solution 275889

Submitted on 8 Jul 2013 by James
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))

a = 5 b = 1 Elapsed time is 0.035816 seconds.

2   Pass
%% n=4; p=3; [a,b]=APk_min_end(p,n); toc assert(isequal(a+b*prod(primes(p))*n,29))

a = 5 b = 1 Elapsed time is 0.067152 seconds.

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

a = 7 b = 1 Elapsed time is 0.071428 seconds.

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

a = 7 b = 5 Elapsed time is 0.077087 seconds.

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

a = 199 b = 1 Elapsed time is 0.108199 seconds.

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

a = 199 b = 1 Elapsed time is 0.142630 seconds.

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

a = 199 b = 1 Elapsed time is 0.178762 seconds.

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

a = 110437 b = 6 Elapsed time is 15.150869 seconds.

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

a = 110437 b = 6 Elapsed time is 31.564225 seconds.

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

a = 4943 b = 2 Elapsed time is 33.793115 seconds.

### Community Treasure Hunt

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

Start Hunting!