# 1985 AHSME Problems/Problem 20

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

## Problem

A wooden cube with edge length $n$ units (where $n$ is an integer $>2$) is painted black all over. By slices parallel to its faces, the cube is cut into $n^3$ smaller cubes each of unit edge length. If the number of smaller cubes with just one face painted black is equal to the number of smaller cubes completely free of paint, what is $n$?

$\mathrm{(A)\ } 5 \qquad \mathrm{(B) \ }6 \qquad \mathrm{(C) \ } 7 \qquad \mathrm{(D) \ } 8 \qquad \mathrm{(E) \ }\text{none of these}$

## Solution

Observe that if we remove the outer layer of unit cubes from the entire cube, what remains is a smaller cube of side length $(n-2)$, which contains all of the unpainted cubes and no others. This shows that there are exactly $(n-2)^3$ unpainted cubes. Similarly, taking one face of the cube and removing the outer edge leaves a square of side length $(n-2)$ containing all of the cubes on that face with exactly one face painted. Making the same argument for the other $5$ faces as well, we deduce that there are a total of $6(n-2)^2$ cubes with only one face painted.

Accordingly, we require \begin{align*}(n-2)^3 = 6(n-2)^2 &\iff n-2 = 6 \qquad \text{(as } n > 2\text{, so } n-2 \neq 0\text{)} \\ &\iff n = \boxed{\text{(D)} \ 8}.\end{align*}