1991 AJHSME Problems/Problem 24

Revision as of 19:42, 15 August 2009 by 5849206328x (talk | contribs) (Created page with '==Problem== A cube of edge <math>3</math> cm is cut into <math>N</math> smaller cubes, not all the same size. If the edge of each of the smaller cubes is a whole number of cent…')
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

A cube of edge $3$ cm is cut into $N$ smaller cubes, not all the same size. If the edge of each of the smaller cubes is a whole number of centimeters, then $N=$

$\text{(A)}\ 4 \qquad \text{(B)}\ 8 \qquad \text{(C)}\ 12 \qquad \text{(D)}\ 16 \qquad \text{(E)}\ 20$

Solution

If none of the cubes have edge length $2$, then all of the cubes have edge length $1$, meaning they all are the same size, a contradiction.

It is clearly impossible to split a cube of edge $3$ into two or more cubes of edge $2$ with extra unit cubes, so there is one $2\times 2\times 2$ cube and $3^3-2^3=19$ unit cubes.

The total number of cubes, $N$, is $1+19=20\rightarrow \boxed{\text{E}}$.

See Also

1991 AJHSME (ProblemsAnswer KeyResources)
Preceded by
Problem 23
Followed by
Problem 25
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
All AJHSME/AMC 8 Problems and Solutions