Back to Minimum overlap problem
n = 10
| f(x) = 0 | for 0 | ≤ x < 1/5 | ||
| f(x) = 0.427849980190994044 | for 1/5 | ≤ x < 2/5 | ||
| f(x) = 0.537828535348129426 | for 2/5 | ≤ x < 3/5 | ||
| f(x) = 0.663356982483178949 | for 3/5 | ≤ x < 4/5 | ||
| f(x) = 0.870964501977697581 | for 4/5 | ≤ x ≤ 1 | ||
| f(x) = f(2-x) | for 1 | < x ≤ 2 |
| | maximal for 1/5 ≤ |k| ≤ 4/5 |