This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = 2;
y_correct = 51;
assert(isequal(pairPrimes(x),y_correct))
assert(~any(cellfun(@(x)ismember(max([0,str2num(x)]),[51,2485,136162,8578934]),regexp(fileread('pairPrimes.m'),'[\d\.\+\-\*\/]+','match'))))
|
2 | Pass |
x = 3;
y_correct = 2485;
assert(isequal(pairPrimes(x),y_correct))
assert(~any(cellfun(@(x)ismember(max([0,str2num(x)]),[51,2485,136162,8578934]),regexp(fileread('pairPrimes.m'),'[\d\.\+\-\*\/]+','match'))))
|
3 | Pass |
x = 4;
y_correct = 136162;
assert(isequal(pairPrimes(x),y_correct))
assert(~any(cellfun(@(x)ismember(max([0,str2num(x)]),[51,2485,136162,8578934]),regexp(fileread('pairPrimes.m'),'[\d\.\+\-\*\/]+','match'))))
|
4 | Pass |
x = 5;
y_correct = 8578934;
assert(isequal(pairPrimes(x),y_correct))
assert(~any(cellfun(@(x)ismember(max([0,str2num(x)]),[51,2485,136162,8578934]),regexp(fileread('pairPrimes.m'),'[\d\.\+\-\*\/]+','match'))))
|
647 Solvers
The Goldbach Conjecture, Part 2
961 Solvers
Back to basics 11 - Max Integer
611 Solvers
88 Solvers
50 Solvers