AoPSWiki
Try our innovative online adaptive learning system, Alcumus.
Over 1100 problems and 60+ video lessons. FREE!

1987 AJHSME Problems/Problem 7

From AoPSWiki

Problem

The large cube shown is made up of 27 identical sized smaller cubes. For each face of the large cube, the opposite face is shaded the same way. The total number of smaller cubes that must have at least one face shaded is

\text{(A)}\ 10 \qquad \text{(B)}\ 16 \qquad \text{(C)}\ 20 \qquad \text{(D)}\ 22 \qquad \text{(E)}\ 24

unitsize(36);draw((0,0)--(3,0)--(3,3)--(0,3)--cycle);draw((3,0)--(5.2,1.4)--(5.2,4.4)--(3,3));draw((0,3)--(2.2,4.4)--(5.2,4.4...

Solution

Clearly no cube has more than one face painted. Therefore, the number of cubes with at least one face painted is equal to the number of painted unit squares.

There are 10 painted unit squares on the half of the cube shown, so there are 10\cdot 2=20 cubes with at least one face painted.

\boxed{\text{C}}

See Also

1987 AJHSME (ProblemsResources)
Preceded by
Problem 6
Followed by
Problem 8
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
Want to learn how to tackle those tough MATHCOUNTS and AMC counting and probability problems? Check out Art of Problem Solving's Introduction to Counting & Probability by David Patrick.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us