ÖMO 1983 Problem 6
Planes and in Euclidean space partition into several components. Show that for any cube in , at least one of the components of meets at least three faces of the cube.
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.