construct/mc hadamard
construct/mc hadamard: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Find two sequences x 0..10 and y 0..10 with entries in {-1, +1} (a Legendre pair of length 11) such that (a) sum(x) = 1 and sum(y) = 1, and (b) for every k = 1..5: sum {i=0}^{10} x i x (i+k) mod 11 + sum…
The task
Find two sequences x[0..10] and y[0..10] with entries in {-1, +1} (a Legendre pair of length 11) such that (a) sum(x) = 1 and sum(y) = 1, and (b) for every k = 1..5: sum_{i=0}^{10} x[i]*x[(i+k) mod 11] + sum_{i=0}^{10} y[i]*y[(i+k) mod 11] = -2.