Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = 2;
y_correct = [1 2; 2 4];
assert(isequal(timestables(x),y_correct))
m =
1 2
2 4
|
2 | Pass |
x = 3;
y_correct = [1 2 3; 2 4 6; 3 6 9];
assert(isequal(timestables(x),y_correct))
m =
1 2 3
2 4 6
3 6 9
|
3 | Pass |
x = 5;
y_correct = [1 2 3 4 5; 2 4 6 8 10; 3 6 9 12 15; 4 8 12 16 20; 5 10 15 20 25];
assert(isequal(timestables(x),y_correct))
m =
1 2 3 4 5
2 4 6 8 10
3 6 9 12 15
4 8 12 16 20
5 10 15 20 25
|
960 Solvers
The Goldbach Conjecture, Part 2
961 Solvers
1627 Solvers
Find nearest prime number less than input number
181 Solvers
194 Solvers