Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 1e2;
y_correct = 3;
f_correct = 3/25;
[y,f] = Mersenne_prime_comp(n);
assert(isequal(y,y_correct))
assert(isequal(f,f_correct))
|
2 | Pass |
n = 1e3;
y_correct = 4;
f_correct = 0.023809523809524;
[y,f] = Mersenne_prime_comp(n);
assert(isequal(y,y_correct))
assert(abs(f-f_correct)<(10*eps))
|
3 | Pass |
n = 1e4;
y_correct = 5;
f_correct = 0.004068348250610;
[y,f] = Mersenne_prime_comp(n);
assert(isequal(y,y_correct))
assert(abs(f-f_correct)<(10*eps))
|
4 | Pass |
n = 1e5;
y_correct = 5;
f_correct = 5.212677231025855e-04;
[y,f] = Mersenne_prime_comp(n);
assert(isequal(y,y_correct))
assert(abs(f-f_correct)<(10*eps))
|
5 | Pass |
n = 1e6;
y_correct = 7;
f_correct = 8.917424647761727e-05;
[y,f] = Mersenne_prime_comp(n);
assert(isequal(y,y_correct))
assert(abs(f-f_correct)<(10*eps))
|
Project Euler: Problem 6, Natural numbers, squares and sums.
785 Solvers
Set the array elements whose value is 13 to 0
753 Solvers
Fahrenheit to Celsius converter
262 Solvers
579 Solvers
316 Solvers