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 = 1;
y_correct = [];
assert(isequal(sym_gen(x),y_correct))
|
2 | Pass |
x = 2;
y_correct = [1 4 1];
assert(isequal(sym_gen(x),y_correct))
|
3 | Pass |
x = 3;
y_correct = [];
assert(isequal(sym_gen(x),y_correct))
|
4 | Pass |
x = 4;
y_correct = [1 4 2 4 1];
assert(isequal(sym_gen(x),y_correct))
|
5 | Pass |
x = 5;
y_correct = [];
assert(isequal(sym_gen(x),y_correct))
|
6 | Pass |
x = 6;
y_correct = [1 4 2 4 2 4 1];
assert(isequal(sym_gen(x),y_correct))
|
7 | Pass |
x = -2;
y_correct = [];
assert(isequal(sym_gen(x),y_correct))
|
8 | Pass |
x = -1;
y_correct = [];
assert(isequal(sym_gen(x),y_correct))
|
5171 Solvers
Numbers with prime factors 2, 3 and 5.
114 Solvers
405 Solvers
579 Solvers
1027 Solvers