Back to Minimum overlap problem
n = 11
f(x) = 0 | for 0 | ≤ x < 2/11 | ||
f(x) = 0.40927102724537031493078911531197074319496439451091 | for 2/11 | ≤ x < 4/11 | ||
f(x) = 0.48949727431597144473464116714975062426573698805027 | for 4/11 | ≤ x < 6/11 | ||
f(x) = 0.59195016227654047852123164261388200249258432927523 | for 6/11 | ≤ x < 8/11 | ||
f(x) = 0.76613894272687659312982232136375498416154510138067 | for 8/11 | ≤ x < 10/11 | ||
f(x) = 0.98628518687048233736703150712134329177033837356584 | for 10/11 | ≤ x ≤ 1 | ||
f(x) = f(2-x) | for 1 | < x ≤ 2 |
maximal for 2/11 ≤ |k| ≤ 8/11 |