Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
x = 31;
y_correct = 31;
assert(isequal(unique_prime_factors(x),y_correct))
|
2 | Pass |
%%
x = 37;
y_correct = 37;
assert(isequal(unique_prime_factors(x),y_correct))
|
3 | Pass |
%%
x = 39;
y_correct = [13 3];
assert(isequal(unique_prime_factors(x),y_correct))
|
4 | Pass |
%%
x = 876;
y_correct = [73 3 2];
assert(isequal(unique_prime_factors(x),y_correct))
|
Project Euler: Problem 10, Sum of Primes
556 Solvers
Find best placement for ordered dominoes (harder)
194 Solvers
812 Solvers
263 Solvers
394 Solvers