Cody

# Problem 3003. Mobius function

Solution 1946046

Submitted on 22 Sep 2019 by Augusto Mazzei
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   Pass
n = 1:5; arr_corr = [1, -1, -1, 0, -1]; assert(isequal(mobius_func_seq(n),arr_corr))

1 -1 -1 0 -1

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

1 -1 -1 0 -1 1 -1 0 0 1

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

-1 0 -1 1 -1

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

0 1 1 -1 0 0 1 0 0 -1 -1

5   Pass
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))

Columns 1 through 30 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 Columns 31 through 60 -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 Columns 61 through 77 -1 1 0 0 1 -1 -1 0 1 -1 -1 0 -1 1 0 0 1

6   Pass
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))

-1 0 -1 1 -1 0 0 1 -1 0 -1 1 1 0 -1