Figure 5 - Efficient Algorithms for Envy-Free Stick Division With Fewest Cuts
When considering cut lengths L (i) /j, no j larger than k /i is relevant. The sketch shows a cutting with L (i) and j = k /i. Note how we have k maximal pieces for sure (dark); there may be many more (light).