Cody

# Problem 3003. Mobius function

Solution 1688865

Submitted on 8 Dec 2018
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Fail
n = 1:5; arr_corr = [1, -1, -1, 0, -1]; assert(isequal(mobius_func_seq(n),arr_corr))

Assertion failed.

2   Fail
n = 1:10; arr_corr = [1, -1, -1, 0, -1, 1, -1, 0, 0, 1]; assert(isequal(mobius_func_seq(n),arr_corr))

Assertion failed.

3   Fail
n = 3:7; arr_corr = [-1, 0, -1, 1, -1]; assert(isequal(mobius_func_seq(n),arr_corr))

Assertion failed.

4   Fail
n = 20:30; arr_corr = [0 1 1 -1 0 0 1 0 0 -1 -1]; assert(isequal(mobius_func_seq(n),arr_corr))

Assertion failed.

5   Fail
n = 1:77; arr_corr = [1, -1, -1, 0, -1, 1, -1, 0, 0, 1, -1, 0, -1, 1, 1, 0, -1, 0, -1, 0, 1, 1, -1, 0, 0, 1, 0, 0, -1, -1, -1, 0, 1, 1, 1, 0, -1, 1, 1, 0, -1, -1, -1, 0, 0, 1, -1, 0, 0, 0, 1, 0, -1, 0, 1, 0, 1, 1, -1, 0, -1, 1, 0, 0, 1, -1, -1, 0, 1, -1, -1, 0, -1, 1, 0, 0, 1]; assert(isequal(mobius_func_seq(n),arr_corr))

Assertion failed.

6   Fail
i1 = randi(20,1); n = i1:(i1+randi(25,1)); arr_tot = [1, -1, -1, 0, -1, 1, -1, 0, 0, 1, -1, 0, -1, 1, 1, 0, -1, 0, -1, 0, 1, 1, -1, 0, 0, 1, 0, 0, -1, -1, -1, 0, 1, 1, 1, 0, -1, 1, 1, 0, -1, -1, -1, 0, 0, 1, -1, 0, 0, 0, 1, 0, -1, 0, 1, 0, 1, 1, -1, 0, -1, 1, 0, 0, 1, -1, -1, 0, 1, -1, -1, 0, -1, 1, 0, 0, 1]; arr_corr = arr_tot(n); assert(isequal(mobius_func_seq(n),arr_corr))

Assertion failed.