MathDB
Defensively Painting Cubes

Source: Spring 2006 Tournament of Towns Junior O-Level #5

April 15, 2015

Problem Statement

Pete has n3n^3 white cubes of the size 1×1×11\times 1\times 1. He wants to construct a n×n×nn\times n\times n cube with all its faces being completely white. Find the minimal number of the faces of small cubes that Basil must paint (in black colour) in order to prevent Pete from fulfilling his task. Consider the cases: a) n=2n = 2; (2 points) b) n=3n = 3. (4 points)
Back to ProblemsView on AoPS