An Odd Order Search Problem
R. S. Booth · SIAM Journal on Algebraic and Discrete Methods · 1982
Select $k + 1$ points in a given interval. Successively remove an end subinterval and select a new point in the remaining interval. It is desired to calculate how fast the sequence of lengths of successive intervals decreases. The answer has long been known when k is even or when $k = 1$ or 3. The present paper deals with $k = 5$ and exhibits the difficulties in proceeding to higher odd k.