ILL 1988 Problem 11
Let be vectors in the plane, each of length with zero sum. Show that one can arrange as a sequence such that each partial sum has length less than or equal to
Dataset text AoPS wiki problems. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.