MathDB

10.7

Part of 1998 All-Russian Olympiad Regional Round

Problems(1)

Nice and easy combinatorics

Source: All-Russian 1998

5/7/2020
A cube of side length nn is divided into unit cubes by partitions (each partition separates a pair of adjacent unit cubes). What is the smallest number of partitions that can be removed so that from each cube, one can reach the surface of the cube without passing through a partition ?
combinatorics