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