IT-CESENATICO 1992 Problem 1
A cube is divided into equal smaller cubes. A plane intersects the cube. Find the maximum possible number of smaller cubes the plane can intersect.
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.