Solution 325923

Submitted on 30 Sep 2013 by Alfonso Nieto-Castanon
  • Size: 91
  • This is the leading solution.
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 0.292316 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 0.586110 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 0.910014 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 1.228290 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 1.553395 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 1.887962 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 2.238419 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 2.610374 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 2.981258 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 3.298970 seconds.