Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
n = [1 10 100];
a(1)=(((n(1)*3)+6)/3)-n(1);
a(2)=(((n(2)*2)+9)-3)/2-n(2);
a(3)=(((n(3)+7)*2)-4)/2-n(3);
y_correct = a;
assert(isequal(strange(n),y_correct))
ans =
2 3 5
|
2 | Pass |
%%
n = [0 499 999];
a(1)=(((n(1)*3)+6)/3)-n(1);
a(2)=(((n(2)*2)+9)-3)/2-n(2);
a(3)=(((n(3)+7)*2)-4)/2-n(3);
y_correct = a;
assert(isequal(strange(n),y_correct))
ans =
2 3 5
|
3 | Pass |
%%
n = [999 666 333];
a(1)=(((n(1)*3)+6)/3)-n(1);
a(2)=(((n(2)*2)+9)-3)/2-n(2);
a(3)=(((n(3)+7)*2)-4)/2-n(3);
y_correct = a;
assert(isequal(strange(n),y_correct))
ans =
2 3 5
|
4 | Pass |
%%
n = [7 63 347];
a(1)=(((n(1)*3)+6)/3)-n(1);
a(2)=(((n(2)*2)+9)-3)/2-n(2);
a(3)=(((n(3)+7)*2)-4)/2-n(3);
y_correct = a;
assert(isequal(strange(n),y_correct))
ans =
2 3 5
|
Find the peak 3n+1 sequence value
1107 Solvers
2538 Solvers
Put Two 1D matrices into one 1D matrix
110 Solvers
369 Solvers
480 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!