IR-TST 2009 Problem 6
We have a closed path on a vertices of a × square which pass from each vertice exactly once . prove that we have two adjacent vertices such that if we cut the path from these points then length of each pieces is not less than quarter of total path .
Dataset text AI-MO AoPS. 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.