TOT 460 1995 Spring S A5 divide line segment [0,1] into BW segments
Source:
July 9, 2024
combinatoricsColoring
Problem Statement
(a) Divide the line segment into smaller black and white segments so that, for any polynomial of degree no greater than two, the sum of increments of along all the black segments is equal to that along the white ones. (The increment of along the segment is the number .)(b) Can this be done for all polynomials of degree no greater than ? (Burkov)