MathDB
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 [0,1][0,1] into smaller black and white segments so that, for any polynomial p(x)p(x) of degree no greater than two, the sum of increments of p(x)p(x) along all the black segments is equal to that along the white ones. (The increment of p(x)p(x) along the segment [a,n][a, n] is the number p(b)āˆ’p(a)p(b) - p(a).)
(b) Can this be done for all polynomials of degree no greater than 19951995?
(Burkov)